java -ea -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/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:05:57,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:05:57,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:05:57,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:05:57,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:05:57,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:05:57,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:05:57,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:05:57,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:05:57,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:05:57,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:05:57,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:05:57,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:05:57,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:05:57,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:05:57,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:05:57,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:05:57,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:05:57,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:05:57,440 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:05:57,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:05:57,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:05:57,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:05:57,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:05:57,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:05:57,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:05:57,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:05:57,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:05:57,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:05:57,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:05:57,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:05:57,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:05:57,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:05:57,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:05:57,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:05:57,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:05:57,454 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-19 12:05:57,467 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:05:57,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:05:57,468 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:05:57,468 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:05:57,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:05:57,469 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:05:57,469 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:05:57,469 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:05:57,469 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 12:05:57,469 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:05:57,470 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 12:05:57,470 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 12:05:57,470 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:05:57,470 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:05:57,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:05:57,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:05:57,471 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:05:57,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:05:57,472 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:05:57,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:05:57,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:05:57,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:05:57,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:05:57,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:05:57,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:05:57,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:05:57,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:05:57,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:05:57,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:05:57,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:05:57,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:05:57,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:05:57,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:05:57,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:05:57,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:05:57,476 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:05:57,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:05:57,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:05:57,476 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:05:57,477 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:05:57,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:05:57,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:05:57,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:05:57,534 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:05:57,534 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:05:57,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2018-12-19 12:05:57,535 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2018-12-19 12:05:57,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:05:57,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:05:57,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:05:57,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:05:57,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:05:57,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,622 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-19 12:05:57,622 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-19 12:05:57,622 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-19 12:05:57,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:05:57,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:05:57,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:05:57,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:05:57,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/1) ... [2018-12-19 12:05:57,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:05:57,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:05:57,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:05:57,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:05:57,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (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-19 12:05:57,730 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-19 12:05:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-19 12:05:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-19 12:05:58,071 INFO L272 CfgBuilder]: Using library mode [2018-12-19 12:05:58,071 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-19 12:05:58,072 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:05:58 BoogieIcfgContainer [2018-12-19 12:05:58,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:05:58,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:05:58,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:05:58,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:05:58,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:05:57" (1/2) ... [2018-12-19 12:05:58,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3807467a and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:05:58, skipping insertion in model container [2018-12-19 12:05:58,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:05:58" (2/2) ... [2018-12-19 12:05:58,081 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2018-12-19 12:05:58,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:05:58,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-19 12:05:58,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-19 12:05:58,153 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:05:58,153 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:05:58,153 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:05:58,154 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:05:58,154 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:05:58,154 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:05:58,154 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:05:58,154 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:05:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-19 12:05:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:05:58,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:05:58,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:05:58,180 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:05:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:05:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-19 12:05:58,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:05:58,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:05:58,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:05:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:05:58,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:05:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:05:58,729 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} is VALID [2018-12-19 12:05:58,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} assume a[x] == 0; {12#(= (select main_a main_y) 1000)} is VALID [2018-12-19 12:05:58,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2018-12-19 12:05:58,740 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-19 12:05:58,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:05:58,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-19 12:05:58,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:05:58,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:05:58,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:05:58,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:05:58,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:05:58,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:05:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:05:58,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:05:58,795 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-19 12:05:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:05:58,980 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-19 12:05:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:05:58,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:05:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:05:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:05:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-19 12:05:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:05:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-19 12:05:58,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2018-12-19 12:05:59,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:05:59,138 INFO L225 Difference]: With dead ends: 15 [2018-12-19 12:05:59,138 INFO L226 Difference]: Without dead ends: 5 [2018-12-19 12:05:59,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:05:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-19 12:05:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-19 12:05:59,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:05:59,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-19 12:05:59,254 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-19 12:05:59,254 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-19 12:05:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:05:59,256 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-19 12:05:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:05:59,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:05:59,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:05:59,257 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-19 12:05:59,257 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-19 12:05:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:05:59,259 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-19 12:05:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:05:59,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:05:59,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:05:59,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:05:59,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:05:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:05:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-19 12:05:59,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-19 12:05:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:05:59,267 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-19 12:05:59,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:05:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:05:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:05:59,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:05:59,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:05:59,268 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:05:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:05:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-19 12:05:59,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:05:59,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:05:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:05:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:05:59,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:05:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:05:59,677 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} is VALID [2018-12-19 12:05:59,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {52#(= (select main_a main_x) 1000)} is VALID [2018-12-19 12:05:59,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2018-12-19 12:05:59,701 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-19 12:05:59,702 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-19 12:05:59,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:05:59,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:05:59,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:05:59,706 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-19 12:05:59,748 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:05:59,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:05:59,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:05:59,871 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 22 root evaluator evaluations with a maximum evaluation depth of 3. Performed 22 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:05:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:05:59,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:05:59,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:05:59,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:05:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:05:59,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:05:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:05:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:05:59,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:06:00,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:06:00,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-19 12:06:00,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:00,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:00,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:00,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-19 12:06:00,210 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:00,210 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (and (= main_a (store (store v_main_a_11 main_x 1000) main_y 0)) (= main_y (+ main_x 1))) [2018-12-19 12:06:00,210 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-19 12:06:00,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-12-19 12:06:00,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:00,899 INFO L303 Elim1Store]: Index analysis took 197 ms [2018-12-19 12:06:00,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 70 [2018-12-19 12:06:00,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:01,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 90 [2018-12-19 12:06:01,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:01,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-19 12:06:01,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 57 [2018-12-19 12:06:01,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-12-19 12:06:01,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:01,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:01,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2018-12-19 12:06:01,324 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:01,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-19 12:06:01,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-19 12:06:01,569 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2018-12-19 12:06:03,757 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:03,758 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_12, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse2 (select v_main_a_12 main_xold))) (and (= (select v_main_a_12 .cse0) 0) (= main_x (mod .cse0 256)) (= (let ((.cse1 (store v_main_a_12 main_x .cse2))) (store .cse1 (mod (+ main_xold 2) 256) (select .cse1 main_yold))) main_a) (= .cse2 1000))) [2018-12-19 12:06:03,758 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4, v_prenex_3]. (let ((.cse6 (select main_a main_x)) (.cse1 (select main_a (+ main_x (- 1))))) (let ((.cse2 (= main_x (mod main_x 256))) (.cse3 (= 1000 .cse1)) (.cse0 (select main_a (mod (+ main_x 1) 256))) (.cse4 (= .cse6 .cse1))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4) (let ((.cse5 (select main_a v_prenex_4)) (.cse7 (+ v_prenex_4 1))) (and (= (select main_a (mod (+ v_prenex_4 2) 256)) .cse5) (= .cse6 .cse5) (= .cse5 1000) (= 0 (select main_a .cse7)) (= main_x (mod .cse7 256)))) (and .cse2 .cse3 (= .cse0 (select main_a v_prenex_3)) .cse4) (let ((.cse8 (select main_a main_xold)) (.cse9 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse6 .cse8) (= 0 (select main_a .cse9)) (= .cse8 1000) (= main_x (mod .cse9 256))))))) [2018-12-19 12:06:04,000 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-12-19 12:06:04,171 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-19 12:06:06,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-19 12:06:06,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} assume a[x] == 0; {50#false} is VALID [2018-12-19 12:06:06,225 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-19 12:06:06,226 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-19 12:06:06,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:06:06,401 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2018-12-19 12:06:06,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2018-12-19 12:06:06,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {70#(not (= (select main_a main_x) 0))} is VALID [2018-12-19 12:06:06,406 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:06:06,407 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-19 12:06:06,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:06:06,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-19 12:06:06,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:06:06,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:06:06,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:06:06,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:06:08,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-19 12:06:08,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:06:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:06:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:06:08,470 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-19 12:06:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:12,558 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-19 12:06:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:06:12,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:06:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:06:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:06:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-19 12:06:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:06:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-19 12:06:12,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2018-12-19 12:06:14,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-19 12:06:14,626 INFO L225 Difference]: With dead ends: 8 [2018-12-19 12:06:14,626 INFO L226 Difference]: Without dead ends: 6 [2018-12-19 12:06:14,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:06:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-19 12:06:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-19 12:06:14,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:06:14,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-19 12:06:14,655 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-19 12:06:14,655 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-19 12:06:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:14,656 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-19 12:06:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-19 12:06:14,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:06:14,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:06:14,657 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-19 12:06:14,657 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-19 12:06:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:14,658 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-19 12:06:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-19 12:06:14,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:06:14,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:06:14,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:06:14,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:06:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:06:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-19 12:06:14,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-19 12:06:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:06:14,726 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-19 12:06:14,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:06:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-19 12:06:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:06:14,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:06:14,727 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-19 12:06:14,727 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:06:14,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:06:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-19 12:06:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:06:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:06:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:14,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:06:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:15,175 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2018-12-19 12:06:15,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} is VALID [2018-12-19 12:06:15,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {113#(= 1000 (select main_a main_x))} is VALID [2018-12-19 12:06:15,181 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2018-12-19 12:06:15,182 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-19 12:06:15,182 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-19 12:06:15,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:06:15,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:06:15,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:06:15,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:06:15,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:06:15,184 INFO L193 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-19 12:06:15,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-19 12:06:15,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-19 12:06:15,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-19 12:06:15,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:06:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:15,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:06:15,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:06:15,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-19 12:06:15,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-19 12:06:15,284 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:15,284 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_14]. (and (= (store (store v_main_a_14 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2018-12-19 12:06:15,285 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-19 12:06:15,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 53 [2018-12-19 12:06:15,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2018-12-19 12:06:15,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2018-12-19 12:06:15,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-19 12:06:15,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2018-12-19 12:06:15,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2018-12-19 12:06:15,736 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:15,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 46 [2018-12-19 12:06:15,881 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:15,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-19 12:06:16,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-19 12:06:16,021 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2018-12-19 12:06:18,214 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:18,215 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_15, main_xold, main_yold]. (let ((.cse0 (select v_main_a_15 main_xold)) (.cse2 (+ main_xold 1))) (and (= 1000 .cse0) (= (let ((.cse1 (store v_main_a_15 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a) (= (select v_main_a_15 .cse2) 0) (= main_x (mod .cse2 256)) (= main_y (mod (+ main_xold 2) 256)))) [2018-12-19 12:06:18,215 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_8, v_prenex_7]. (let ((.cse0 (select main_a main_x)) (.cse10 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse3 (select main_a main_y)) (.cse7 (= main_x (mod main_x 256))) (.cse8 (= 1000 .cse10)) (.cse9 (= .cse0 .cse10))) (or (let ((.cse1 (select main_a v_prenex_8)) (.cse2 (+ v_prenex_8 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_8 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= .cse4 1000) (= 0 (select main_a .cse5)) (= main_x (mod .cse5 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 .cse7 (= .cse3 (select main_a v_prenex_7)) .cse8 .cse9) (and .cse6 (= .cse3 .cse10) .cse7 .cse8 .cse9)))) [2018-12-19 12:06:18,515 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2018-12-19 12:06:18,728 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-19 12:06:18,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 72 [2018-12-19 12:06:18,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 100 [2018-12-19 12:06:18,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:18,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-12-19 12:06:18,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:18,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 93 [2018-12-19 12:06:18,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:18,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:19,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 122 [2018-12-19 12:06:19,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 167 [2018-12-19 12:06:19,405 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:19,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:19,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 125 [2018-12-19 12:06:19,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:19,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 164 [2018-12-19 12:06:19,595 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:19,669 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:19,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-19 12:06:19,838 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2018-12-19 12:06:22,071 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:22,072 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_16, main_xold, main_yold, v_prenex_9, v_subst_1]. (or (let ((.cse1 (select v_main_a_16 (+ main_xold (- 1)))) (.cse2 (mod (+ main_xold 1) 256)) (.cse0 (select v_main_a_16 main_xold))) (and (= .cse0 .cse1) (= main_xold (mod main_xold 256)) (= 1000 .cse1) (= main_x .cse2) (= (let ((.cse3 (store v_main_a_16 main_x .cse0))) (store .cse3 (mod (+ .cse2 1) 256) (select .cse3 main_yold))) main_a))) (let ((.cse8 (+ v_subst_1 1))) (let ((.cse7 (mod .cse8 256))) (let ((.cse5 (select v_prenex_9 .cse7)) (.cse4 (select v_prenex_9 v_subst_1))) (and (= .cse4 .cse5) (= (let ((.cse6 (store v_prenex_9 main_x .cse5))) (store .cse6 (mod (+ (mod (+ v_subst_1 2) 256) 1) 256) (select .cse6 main_yold))) main_a) (= .cse4 1000) (= main_x (mod (+ .cse7 1) 256)) (= 0 (select v_prenex_9 .cse8))))))) [2018-12-19 12:06:22,072 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, v_prenex_11, main_xold, v_prenex_10]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse3 (+ v_subst_1 1))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (select main_a v_subst_1)) (.cse2 (select main_a .cse0))) (and (= main_x (mod (+ .cse0 1) 256)) (= .cse1 .cse2) (= (select main_a .cse3) 0) (= .cse1 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= .cse4 .cse2))))) (let ((.cse8 (+ v_prenex_11 1))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (select main_a v_prenex_11)) (.cse5 (select main_a .cse6))) (and (= .cse5 (select main_a (mod (+ (mod (+ v_prenex_11 2) 256) 1) 256))) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse5) (= .cse7 1000) (= (select main_a .cse8) 0) (= .cse4 .cse5))))) (let ((.cse9 (select main_a main_xold)) (.cse11 (mod (+ main_xold 1) 256)) (.cse10 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse9 .cse10) (= .cse4 .cse9) (= main_x .cse11) (= (select main_a (mod (+ .cse11 1) 256)) (select main_a v_prenex_10)) (= 1000 .cse10))))) [2018-12-19 12:06:22,377 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-19 12:06:22,401 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-19 12:06:24,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-19 12:06:26,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2018-12-19 12:06:26,473 INFO L273 TraceCheckUtils]: 3: Hoare triple {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2018-12-19 12:06:26,473 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-19 12:06:26,474 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-19 12:06:26,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:06:28,623 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2018-12-19 12:06:28,625 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2018-12-19 12:06:28,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {135#(not (= (select main_a main_x) 0))} is VALID [2018-12-19 12:06:28,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2018-12-19 12:06:28,636 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2018-12-19 12:06:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:06:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:06:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-19 12:06:28,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:06:28,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:06:28,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:06:28,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:06:32,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-12-19 12:06:32,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:06:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:06:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-12-19 12:06:32,718 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-19 12:06:43,796 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-12-19 12:06:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:47,947 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-12-19 12:06:47,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:06:47,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:06:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:06:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:06:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-19 12:06:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:06:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-19 12:06:47,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2018-12-19 12:06:52,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-12-19 12:06:52,042 INFO L225 Difference]: With dead ends: 10 [2018-12-19 12:06:52,042 INFO L226 Difference]: Without dead ends: 8 [2018-12-19 12:06:52,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:06:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-19 12:06:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-19 12:06:52,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:06:52,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-19 12:06:52,074 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-19 12:06:52,074 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-19 12:06:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:52,076 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-19 12:06:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-19 12:06:52,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:06:52,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:06:52,076 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-19 12:06:52,077 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-19 12:06:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:52,077 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-19 12:06:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-19 12:06:52,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:06:52,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:06:52,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:06:52,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:06:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:06:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-19 12:06:52,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-19 12:06:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:06:52,079 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-19 12:06:52,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:06:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-19 12:06:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-19 12:06:52,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:06:52,080 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-19 12:06:52,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:06:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:06:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2018-12-19 12:06:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:06:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:52,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:06:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:52,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:06:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:52,838 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2018-12-19 12:06:52,936 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2018-12-19 12:06:52,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} is VALID [2018-12-19 12:06:52,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:06:52,955 INFO L273 TraceCheckUtils]: 3: Hoare triple {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:06:52,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {197#(= (select main_a main_y) 1000)} is VALID [2018-12-19 12:06:52,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#(= (select main_a main_y) 1000)} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2018-12-19 12:06:52,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2018-12-19 12:06:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:06:52,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:06:52,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:06:52,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:06:52,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:06:52,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:06:52,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:06:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-19 12:06:52,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-19 12:06:53,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-19 12:06:53,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:06:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:53,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:06:53,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:06:53,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-19 12:06:53,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-19 12:06:53,334 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:53,334 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_19]. (and (= main_y (+ main_x 1)) (= (store (store v_main_a_19 main_x 1000) main_y 0) main_a)) [2018-12-19 12:06:53,334 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-19 12:06:53,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-12-19 12:06:53,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-12-19 12:06:53,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-12-19 12:06:53,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:53,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2018-12-19 12:06:53,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:53,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-19 12:06:53,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2018-12-19 12:06:55,956 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:55,957 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_20, main_yold]. (let ((.cse1 (select v_main_a_20 (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= (select v_main_a_20 main_yold) 0) (= (let ((.cse0 (store v_main_a_20 main_x .cse1))) (store .cse0 main_y (select .cse0 main_yold))) main_a) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 1000))) [2018-12-19 12:06:55,957 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2018-12-19 12:06:56,313 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-19 12:06:56,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2018-12-19 12:06:56,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2018-12-19 12:06:56,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:56,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:56,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,631 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:06:56,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 148 [2018-12-19 12:06:56,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:56,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 136 [2018-12-19 12:06:56,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:56,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:56,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-19 12:06:56,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2018-12-19 12:06:58,851 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:06:58,851 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_12, main_xold]. (or (let ((.cse5 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_21 v_subst_2)) (.cse4 (select v_main_a_21 (+ v_subst_2 (- 1)))) (.cse3 (select v_main_a_21 .cse5)) (.cse1 (mod (+ v_subst_2 1) 256))) (and (= 0 .cse0) (= (select v_main_a_21 .cse1) .cse0) (= main_a (let ((.cse2 (store v_main_a_21 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1)))) (= 1000 .cse4) (= .cse4 .cse3) (= main_x (mod (+ .cse5 1) 256)) (= (mod (+ .cse1 1) 256) main_y)))) (let ((.cse8 (select v_prenex_12 main_xold)) (.cse9 (select v_prenex_12 (+ main_xold (- 1)))) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_12 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= .cse8 .cse9) (= .cse9 1000) (= main_x .cse7) (= .cse9 (select v_prenex_12 .cse7)) (= main_y (mod (+ .cse7 1) 256))))) [2018-12-19 12:06:58,851 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (or (let ((.cse3 (mod v_subst_2 256))) (let ((.cse2 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a .cse3))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse2 1) 256) main_y) (= main_x .cse2) (= .cse0 .cse1) (= (select main_a (mod (+ .cse3 1) 256)) .cse1)))) (let ((.cse6 (mod (+ main_xold 1) 256))) (let ((.cse5 (select main_a (+ main_xold (- 1)))) (.cse4 (select main_a main_xold)) (.cse7 (mod (+ .cse6 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse4 .cse5) (= (select main_a main_x) .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7)))))) [2018-12-19 12:06:59,680 WARN L181 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-12-19 12:06:59,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 161 [2018-12-19 12:06:59,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 159 [2018-12-19 12:06:59,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,088 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:07:00,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 270 [2018-12-19 12:07:00,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 192 [2018-12-19 12:07:00,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-19 12:07:00,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2018-12-19 12:07:02,550 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:02,550 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_22, v_subst_2, v_prenex_13, v_subst_3]. (or (let ((.cse4 (mod v_subst_2 256)) (.cse2 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse2 1) 256)) (.cse3 (select v_main_a_22 (+ v_subst_2 (- 1)))) (.cse5 (select v_main_a_22 .cse4))) (and (= (let ((.cse0 (store v_main_a_22 main_x (select v_main_a_22 .cse2)))) (store .cse0 main_y (select .cse0 .cse1))) main_a) (= (select v_main_a_22 v_subst_2) 0) (= 1000 .cse3) (= (mod (+ .cse1 1) 256) main_y) (= (select v_main_a_22 (mod (+ .cse4 1) 256)) .cse5) (= .cse1 main_x) (= (select v_main_a_22 .cse1) .cse5) (= .cse3 .cse5)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse7 (select v_prenex_13 (+ v_subst_3 (- 1)))) (.cse9 (select v_prenex_13 .cse11)) (.cse10 (select v_prenex_13 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256))) (and (= .cse6 main_x) (= .cse7 1000) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse8 (store v_prenex_13 main_x .cse9))) (store .cse8 main_y (select .cse8 .cse6))) main_a) (= .cse7 .cse10) (= .cse10 .cse9) (= (select v_prenex_13 .cse6) .cse10) (= main_y (mod (+ .cse6 1) 256)))))) [2018-12-19 12:07:02,551 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_3, v_subst_2]. (let ((.cse3 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_3 1) 256))) (let ((.cse0 (mod (+ .cse4 1) 256)) (.cse2 (select main_a .cse4)) (.cse1 (select main_a v_subst_3))) (and (= .cse0 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse1 .cse2) (= main_y (mod (+ .cse0 1) 256)) (= .cse3 .cse2) (= (select main_a .cse0) .cse2) (= .cse1 1000)))) (let ((.cse9 (mod v_subst_2 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse5 (select main_a (+ v_subst_2 (- 1)))) (.cse7 (select main_a (mod (+ .cse9 1) 256))) (.cse8 (select main_a .cse9))) (and (= .cse5 1000) (= (mod (+ .cse6 1) 256) main_y) (= .cse7 .cse3) (= .cse6 main_x) (= .cse7 (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= .cse5 .cse8) (= .cse7 .cse8)))))) [2018-12-19 12:07:08,014 WARN L181 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2018-12-19 12:07:08,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 296 [2018-12-19 12:07:08,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:08,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 212 [2018-12-19 12:07:08,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:08,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:10,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,433 INFO L303 Elim1Store]: Index analysis took 420 ms [2018-12-19 12:07:10,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 394 [2018-12-19 12:07:10,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:10,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 319 [2018-12-19 12:07:10,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:11,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:11,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-19 12:07:11,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2018-12-19 12:07:13,792 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:13,793 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_14, v_subst_3]. (or (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse7 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_23 .cse7)) (.cse2 (select v_main_a_23 (mod (+ .cse7 1) 256))) (.cse3 (mod (+ .cse6 1) 256)) (.cse4 (select v_main_a_23 .cse6)) (.cse1 (select v_main_a_23 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= .cse2 (select v_main_a_23 .cse3)) (= .cse4 .cse2) (= 0 (select v_main_a_23 v_subst_2)) (= .cse0 .cse2) (= .cse3 main_x) (= main_y (mod (+ .cse3 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse3))) main_a) (= .cse1 1000)))) (let ((.cse14 (mod (+ v_subst_3 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse10 (select v_prenex_14 v_subst_3)) (.cse8 (mod (+ .cse13 1) 256)) (.cse9 (select v_prenex_14 .cse14)) (.cse12 (select v_prenex_14 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= 1000 (select v_prenex_14 (+ v_subst_3 (- 1)))) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse11 (store v_prenex_14 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse8))) main_a) (= main_x .cse8) (= 1000 .cse10) (= (select v_prenex_14 .cse8) .cse9) (= .cse9 .cse12)))))) [2018-12-19 12:07:13,793 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse5 (select main_a main_x))) (or (let ((.cse7 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (let ((.cse6 (mod v_subst_2 256)) (.cse4 (mod (+ .cse7 1) 256))) (let ((.cse2 (mod (+ .cse4 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod (+ .cse6 1) 256))) (.cse3 (select main_a .cse7))) (and (= .cse0 1000) (= .cse1 1000) (= (select main_a .cse2) .cse3) (= .cse4 main_x) (= main_y .cse2) (= 0 (select main_a v_subst_2)) (= .cse5 .cse3) (= .cse0 (select main_a .cse6)) (= .cse1 .cse3))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a .cse13)) (.cse8 (mod (+ .cse12 1) 256)) (.cse10 (select main_a v_subst_3))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse5) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 .cse11) (= .cse9 .cse11) (= main_x .cse8) (= .cse10 1000))))))) [2018-12-19 12:07:20,995 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-19 12:07:21,055 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-19 12:07:23,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2018-12-19 12:07:25,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2018-12-19 12:07:27,093 INFO L273 TraceCheckUtils]: 3: Hoare triple {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} is UNKNOWN [2018-12-19 12:07:29,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2018-12-19 12:07:29,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} assume a[x] == 0; {192#false} is VALID [2018-12-19 12:07:29,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2018-12-19 12:07:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:29,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:39,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2018-12-19 12:07:39,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2018-12-19 12:07:39,100 INFO L273 TraceCheckUtils]: 4: Hoare triple {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2018-12-19 12:07:39,659 INFO L273 TraceCheckUtils]: 3: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2018-12-19 12:07:39,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-19 12:07:40,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-19 12:07:40,021 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2018-12-19 12:07:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-19 12:07:40,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:40,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2018-12-19 12:07:40,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:40,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-19 12:07:40,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:40,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-12-19 12:07:46,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:46,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-19 12:07:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-19 12:07:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=135, Unknown=3, NotChecked=0, Total=210 [2018-12-19 12:07:46,459 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2018-12-19 12:08:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:30,044 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-19 12:08:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-19 12:08:30,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-19 12:08:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-19 12:08:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-19 12:08:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-19 12:08:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-19 12:08:30,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2018-12-19 12:08:36,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 13 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:36,714 INFO L225 Difference]: With dead ends: 14 [2018-12-19 12:08:36,714 INFO L226 Difference]: Without dead ends: 11 [2018-12-19 12:08:36,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=72, Invalid=135, Unknown=3, NotChecked=0, Total=210 [2018-12-19 12:08:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-19 12:08:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-19 12:08:36,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:36,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2018-12-19 12:08:36,861 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-19 12:08:36,861 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-19 12:08:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:36,862 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-19 12:08:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-19 12:08:36,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:36,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:36,863 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-19 12:08:36,863 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-19 12:08:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:36,864 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-19 12:08:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-19 12:08:36,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:36,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:36,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:36,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-19 12:08:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-19 12:08:36,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-12-19 12:08:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:36,866 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-19 12:08:36,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-19 12:08:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-19 12:08:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-19 12:08:36,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:36,866 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-19 12:08:36,867 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:36,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 4 times [2018-12-19 12:08:36,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:36,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:36,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:08:36,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:36,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:37,376 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2018-12-19 12:08:37,536 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {309#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2018-12-19 12:08:37,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {310#(and (= 1000 (select main_a main_x)) (<= main_y 255) (or (<= (+ main_x 1) main_y) (and (<= main_x 255) (<= (+ main_y 255) main_x))) (<= main_y (+ main_x 1)) (< 0 (+ main_y 1)))} is VALID [2018-12-19 12:08:37,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#(and (= 1000 (select main_a main_x)) (<= main_y 255) (or (<= (+ main_x 1) main_y) (and (<= main_x 255) (<= (+ main_y 255) main_x))) (<= main_y (+ main_x 1)) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {311#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:08:37,547 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:08:37,549 INFO L273 TraceCheckUtils]: 4: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:08:37,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:08:37,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} is VALID [2018-12-19 12:08:37,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {312#(and (= (select main_a main_x) (select main_a main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {313#(= (select main_a main_y) 1000)} is VALID [2018-12-19 12:08:37,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {313#(= (select main_a main_y) 1000)} assume a[x] == 0; {313#(= (select main_a main_y) 1000)} is VALID [2018-12-19 12:08:37,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {313#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {308#false} is VALID [2018-12-19 12:08:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-19 12:08:37,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:37,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:37,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:08:37,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:08:37,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:37,558 INFO L193 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-19 12:08:37,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:37,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:38,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:38,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-19 12:08:38,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:38,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:38,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-19 12:08:38,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:38,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:38,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:38,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2018-12-19 12:08:38,963 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:38,963 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_28]. (and (= (store (store v_main_a_28 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2018-12-19 12:08:38,964 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2018-12-19 12:08:39,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 53 [2018-12-19 12:08:39,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2018-12-19 12:08:39,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:39,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2018-12-19 12:08:39,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:39,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-19 12:08:39,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2018-12-19 12:08:39,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2018-12-19 12:08:39,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:39,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:39,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 46 [2018-12-19 12:08:39,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:39,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-19 12:08:39,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-19 12:08:39,537 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2018-12-19 12:08:41,747 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:41,748 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse1 (select v_main_a_29 main_xold))) (and (= main_x (mod .cse0 256)) (= .cse1 1000) (= main_y (mod (+ main_xold 2) 256)) (= 0 (select v_main_a_29 .cse0)) (= (let ((.cse2 (store v_main_a_29 main_x .cse1))) (store .cse2 main_y (select .cse2 main_yold))) main_a))) [2018-12-19 12:08:41,748 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_prenex_18, v_prenex_19, main_yold]. (let ((.cse0 (select main_a main_x)) (.cse7 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse8 (= main_x (mod main_x 256))) (.cse3 (select main_a main_y)) (.cse9 (= 1000 .cse7)) (.cse10 (= .cse0 .cse7))) (or (let ((.cse1 (select main_a v_prenex_19)) (.cse2 (+ v_prenex_19 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_19 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= 0 (select main_a .cse5)) (= .cse4 1000) (= main_x (mod .cse5 256)) (= .cse3 (select main_a v_prenex_18)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 (= .cse3 .cse7) .cse8 .cse9 .cse10) (and .cse6 .cse8 (= .cse3 (select main_a main_yold)) .cse9 .cse10)))) [2018-12-19 12:08:42,192 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-19 12:08:42,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 75 [2018-12-19 12:08:42,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 76 [2018-12-19 12:08:42,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 74 [2018-12-19 12:08:42,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2018-12-19 12:08:42,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 125 [2018-12-19 12:08:42,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 135 [2018-12-19 12:08:42,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,834 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 128 [2018-12-19 12:08:42,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:42,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 132 [2018-12-19 12:08:42,915 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:42,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:43,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-19 12:08:43,054 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:131, output treesize:135 [2018-12-19 12:08:45,221 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:45,222 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_30, v_subst_4, main_yold, v_prenex_20, main_xold]. (or (let ((.cse1 (+ v_subst_4 1))) (let ((.cse4 (mod .cse1 256))) (let ((.cse0 (select v_main_a_30 v_subst_4)) (.cse2 (select v_main_a_30 .cse4))) (and (= .cse0 1000) (= (select v_main_a_30 .cse1) 0) (= .cse0 .cse2) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= (let ((.cse3 (store v_main_a_30 main_x .cse2))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= main_x (mod (+ .cse4 1) 256)))))) (let ((.cse6 (select v_prenex_20 main_xold)) (.cse7 (select v_prenex_20 (+ main_xold (- 1)))) (.cse8 (mod (+ main_xold 1) 256))) (and (= (let ((.cse5 (store v_prenex_20 main_x .cse6))) (store .cse5 main_y (select .cse5 main_yold))) main_a) (= main_xold (mod main_xold 256)) (= 1000 .cse7) (= main_x .cse8) (= .cse6 .cse7) (= main_y (mod (+ .cse8 1) 256))))) [2018-12-19 12:08:45,222 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_subst_4, v_prenex_21]. (let ((.cse2 (select main_a main_x))) (or (let ((.cse3 (mod (+ main_xold 1) 256))) (let ((.cse0 (select main_a main_xold)) (.cse4 (mod (+ .cse3 1) 256)) (.cse1 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= .cse2 .cse0) (= main_x .cse3) (= (select main_a .cse4) (select main_a main_yold)) (= main_y .cse4) (= 1000 .cse1)))) (let ((.cse9 (+ v_subst_4 1))) (let ((.cse7 (mod .cse9 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (select main_a .cse7)) (.cse5 (select main_a v_subst_4))) (and (= 1000 .cse5) (= (select main_a .cse6) (select main_a v_prenex_21)) (= main_y .cse6) (= main_x (mod (+ .cse7 1) 256)) (= .cse8 .cse2) (= .cse8 .cse5) (= 0 (select main_a .cse9)))))))) [2018-12-19 12:08:45,661 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-19 12:08:46,215 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-19 12:08:46,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 181 [2018-12-19 12:08:46,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 198 [2018-12-19 12:08:46,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:46,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:46,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 95 treesize of output 178 [2018-12-19 12:08:46,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 201 [2018-12-19 12:08:46,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:46,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:46,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 156 [2018-12-19 12:08:46,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:47,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:48,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:08:48,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,252 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-12-19 12:08:48,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 113 treesize of output 301 [2018-12-19 12:08:48,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 292 treesize of output 336 [2018-12-19 12:08:48,406 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:48,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:48,921 INFO L303 Elim1Store]: Index analysis took 152 ms [2018-12-19 12:08:48,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 302 [2018-12-19 12:08:48,948 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:49,094 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:49,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,486 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:08:49,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,689 INFO L303 Elim1Store]: Index analysis took 457 ms [2018-12-19 12:08:49,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 296 [2018-12-19 12:08:49,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:49,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 317 [2018-12-19 12:08:49,814 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:50,511 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:51,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-19 12:08:51,121 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:223, output treesize:189 [2018-12-19 12:08:53,247 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:53,247 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_31, v_subst_4, main_yold, v_prenex_21, v_prenex_24, v_subst_5, v_prenex_22]. (or (let ((.cse2 (+ v_subst_4 1))) (let ((.cse7 (mod .cse2 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse0 (select v_main_a_31 v_subst_4)) (.cse5 (select v_main_a_31 .cse6)) (.cse1 (select v_main_a_31 .cse7)) (.cse3 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (and (= .cse0 .cse1) (= 0 (select v_main_a_31 .cse2)) (= (mod (+ .cse3 1) 256) main_y) (= .cse0 1000) (= (let ((.cse4 (store v_main_a_31 main_x .cse5))) (store .cse4 main_y (select .cse4 main_yold))) main_a) (= .cse5 .cse1) (= (select v_main_a_31 .cse3) (select v_main_a_31 v_prenex_21)) (= main_x (mod (+ .cse6 1) 256))))))) (let ((.cse13 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse13 1) 256)) (.cse10 (select v_prenex_24 .cse13)) (.cse11 (select v_prenex_24 v_subst_5)) (.cse9 (select v_prenex_24 (+ v_subst_5 (- 1))))) (and (= (select v_prenex_24 v_prenex_22) (select v_prenex_24 .cse8)) (= main_y (mod (+ .cse8 1) 256)) (= 1000 .cse9) (= .cse10 .cse11) (= main_x .cse8) (= v_subst_5 (mod v_subst_5 256)) (= main_a (let ((.cse12 (store v_prenex_24 main_x .cse10))) (store .cse12 main_y (select .cse12 main_yold)))) (= .cse11 .cse9))))) [2018-12-19 12:08:53,248 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_29, v_subst_5, main_yold, v_subst_4]. (let ((.cse4 (select main_a main_y))) (or (let ((.cse5 (mod (+ v_subst_5 1) 256))) (let ((.cse0 (select main_a .cse5)) (.cse3 (select main_a v_subst_5)) (.cse2 (select main_a (+ v_subst_5 (- 1)))) (.cse1 (mod (+ .cse5 1) 256))) (and (= .cse0 (select main_a .cse1)) (= .cse2 1000) (= .cse3 .cse0) (= .cse3 .cse2) (= main_y (mod (+ .cse1 1) 256)) (= .cse4 (select main_a v_prenex_29)) (= main_x .cse1) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse11 (+ v_subst_4 1))) (let ((.cse12 (mod .cse11 256))) (let ((.cse10 (mod (+ .cse12 1) 256))) (let ((.cse9 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse7 (select main_a .cse10)) (.cse6 (select main_a .cse12)) (.cse8 (select main_a v_subst_4))) (and (= .cse6 .cse7) (= 1000 .cse8) (= (mod (+ .cse9 1) 256) main_y) (= .cse4 (select main_a main_yold)) (= (select main_a .cse9) .cse7) (= .cse6 .cse8) (= main_x (mod (+ .cse10 1) 256)) (= 0 (select main_a .cse11))))))))) [2018-12-19 12:08:58,367 WARN L181 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-19 12:08:59,919 WARN L181 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 87 [2018-12-19 12:08:59,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:59,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:59,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:59,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:59,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,028 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:09:00,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,193 INFO L303 Elim1Store]: Index analysis took 265 ms [2018-12-19 12:09:00,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 365 [2018-12-19 12:09:00,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 342 [2018-12-19 12:09:00,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:00,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:00,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,721 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:09:00,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:00,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,283 INFO L303 Elim1Store]: Index analysis took 677 ms [2018-12-19 12:09:01,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 358 [2018-12-19 12:09:01,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:01,507 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-12-19 12:09:01,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 341 [2018-12-19 12:09:01,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:01,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:07,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 216 [2018-12-19 12:09:07,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 207 [2018-12-19 12:09:07,367 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:07,476 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:07,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 209 [2018-12-19 12:09:07,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:07,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 206 [2018-12-19 12:09:07,719 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:07,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:08,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-19 12:09:08,411 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:267, output treesize:367 [2018-12-19 12:09:10,572 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:09:10,573 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_31, v_subst_4, main_yold, v_main_a_32, v_subst_5]. (or (let ((.cse3 (+ v_subst_4 1))) (let ((.cse8 (mod .cse3 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse1 (select v_prenex_31 v_subst_4)) (.cse6 (mod (+ .cse7 1) 256)) (.cse4 (select v_prenex_31 .cse8)) (.cse2 (select v_prenex_31 .cse7))) (and (= main_y (mod (+ (mod (+ .cse0 1) 256) 1) 256)) (= .cse1 1000) (= (select v_prenex_31 .cse0) .cse2) (= (select v_prenex_31 .cse3) 0) (= .cse1 .cse4) (= (let ((.cse5 (store v_prenex_31 main_x (select v_prenex_31 .cse6)))) (store .cse5 main_y (select .cse5 main_yold))) main_a) (= (mod (+ .cse6 1) 256) main_x) (= .cse4 .cse2)))))) (let ((.cse16 (mod (+ v_subst_5 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse10 (select v_main_a_32 .cse16)) (.cse9 (select v_main_a_32 v_subst_5)) (.cse13 (select v_main_a_32 (+ v_subst_5 (- 1)))) (.cse11 (select v_main_a_32 .cse15)) (.cse12 (mod (+ .cse15 1) 256))) (and (= .cse9 .cse10) (= .cse11 .cse10) (= main_x .cse12) (= .cse9 .cse13) (= 1000 .cse13) (= (let ((.cse14 (store v_main_a_32 main_x .cse11))) (store .cse14 main_y (select .cse14 main_yold))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse12 1) 256))))))) [2018-12-19 12:09:10,573 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_prenex_32, v_prenex_33, v_subst_4, main_yold]. (let ((.cse6 (select main_a main_y)) (.cse5 (select main_a main_x))) (or (let ((.cse8 (mod (+ v_prenex_33 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse0 (select main_a .cse8)) (.cse3 (select main_a v_prenex_33)) (.cse2 (select main_a (+ v_prenex_33 (- 1)))) (.cse1 (select main_a .cse7)) (.cse4 (mod (+ .cse7 1) 256))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse3 .cse0) (= .cse3 .cse2) (= main_x .cse4) (= .cse1 .cse5) (= .cse1 .cse6) (= v_prenex_33 (mod v_prenex_33 256)) (= main_y (mod (+ .cse4 1) 256)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse14 (mod (+ .cse15 1) 256))) (let ((.cse9 (select main_a .cse15)) (.cse12 (select main_a v_subst_5)) (.cse11 (select main_a (+ v_subst_5 (- 1)))) (.cse10 (select main_a .cse14)) (.cse13 (mod (+ .cse14 1) 256))) (and (= .cse9 .cse10) (= .cse11 1000) (= .cse12 .cse9) (= .cse12 .cse11) (= main_x .cse13) (= .cse10 .cse5) (= .cse6 (select main_a v_prenex_32)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse13 1) 256)))))) (let ((.cse22 (+ v_subst_4 1))) (let ((.cse23 (mod .cse22 256))) (let ((.cse21 (mod (+ .cse23 1) 256)) (.cse24 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse16 (mod (+ (mod (+ .cse24 1) 256) 1) 256)) (.cse18 (select main_a .cse21)) (.cse20 (select main_a .cse24)) (.cse17 (select main_a .cse23)) (.cse19 (select main_a v_subst_4))) (and (= main_y .cse16) (= .cse17 .cse18) (= 1000 .cse19) (= (select main_a .cse16) (select main_a main_yold)) (= .cse20 .cse18) (= .cse5 .cse20) (= (mod (+ (mod (+ .cse21 1) 256) 1) 256) main_x) (= .cse17 .cse19) (= 0 (select main_a .cse22))))))))) [2018-12-19 12:09:26,996 WARN L181 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-12-19 12:09:29,609 WARN L181 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 100 [2018-12-19 12:09:29,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,728 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-12-19 12:09:29,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 342 [2018-12-19 12:09:29,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:29,975 INFO L303 Elim1Store]: Index analysis took 210 ms [2018-12-19 12:09:29,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 347 [2018-12-19 12:09:29,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:30,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:30,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 353 [2018-12-19 12:09:30,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:30,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 352 [2018-12-19 12:09:30,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:30,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:40,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,487 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:09:40,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:40,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:41,294 INFO L303 Elim1Store]: Index analysis took 1299 ms [2018-12-19 12:09:42,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 683 [2018-12-19 12:09:42,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:42,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:42,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:42,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:42,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:42,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:42,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:43,495 INFO L303 Elim1Store]: Index analysis took 1416 ms [2018-12-19 12:09:43,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 655 treesize of output 759 [2018-12-19 12:09:43,511 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:47,012 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:47,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:09:47,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:47,960 INFO L303 Elim1Store]: Index analysis took 937 ms [2018-12-19 12:09:48,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 214 treesize of output 678 [2018-12-19 12:09:48,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:48,389 INFO L303 Elim1Store]: Index analysis took 247 ms [2018-12-19 12:09:48,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 669 treesize of output 770 [2018-12-19 12:09:48,420 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:50,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:50,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:09:51,663 INFO L303 Elim1Store]: Index analysis took 1180 ms [2018-12-19 12:09:51,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 740 [2018-12-19 12:09:51,671 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-19 12:09:53,329 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:09:53,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-19 12:09:53,814 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:380, output treesize:353 [2018-12-19 12:09:55,962 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:09:55,963 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, main_yold, v_prenex_34, v_prenex_36, v_subst_5]. (or (let ((.cse2 (+ v_subst_4 1))) (let ((.cse9 (mod .cse2 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse6 (mod (+ (mod (+ .cse10 1) 256) 1) 256))) (let ((.cse0 (select v_main_a_33 .cse6)) (.cse1 (select v_main_a_33 .cse11)) (.cse4 (select v_main_a_33 v_subst_4)) (.cse5 (mod (+ (mod (+ .cse11 1) 256) 1) 256)) (.cse7 (select v_main_a_33 .cse10)) (.cse8 (select v_main_a_33 .cse9))) (and (= .cse0 .cse1) (= (select v_main_a_33 .cse2) 0) (= (let ((.cse3 (store v_main_a_33 main_x .cse0))) (store .cse3 main_y (select .cse3 main_yold))) main_a) (= .cse4 1000) (= (select v_main_a_33 .cse5) (select v_main_a_33 v_prenex_34)) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse1) (= .cse4 .cse8) (= main_y (mod (+ .cse5 1) 256)) (= .cse7 .cse8))))))) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse13 (select v_prenex_36 .cse21)) (.cse15 (select v_prenex_36 v_subst_5)) (.cse14 (mod (+ .cse21 1) 256)) (.cse17 (select v_prenex_36 .cse20)) (.cse18 (select v_prenex_36 .cse19)) (.cse16 (select v_prenex_36 (+ v_subst_5 (- 1))))) (and (= main_a (let ((.cse12 (store v_prenex_36 main_x .cse13))) (store .cse12 main_y (select .cse12 main_yold)))) (= main_x .cse14) (= .cse15 .cse16) (= .cse17 .cse13) (= .cse15 .cse18) (= main_y (mod (+ .cse14 1) 256)) (= .cse17 .cse18) (= v_subst_5 (mod v_subst_5 256)) (= .cse16 1000))))))) [2018-12-19 12:09:55,963 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, main_yold, v_subst_5, v_prenex_39]. (or (let ((.cse7 (+ v_subst_4 1))) (let ((.cse9 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (.cse8 (mod .cse7 256))) (let ((.cse10 (mod (+ .cse8 1) 256)) (.cse5 (mod (+ (mod (+ .cse9 1) 256) 1) 256))) (let ((.cse3 (mod (+ .cse5 1) 256)) (.cse1 (select main_a .cse10)) (.cse4 (select main_a (mod (+ (mod (+ .cse10 1) 256) 1) 256))) (.cse6 (select main_a .cse9)) (.cse0 (select main_a .cse8)) (.cse2 (select main_a v_subst_4))) (and (= .cse0 .cse1) (= 1000 .cse2) (= (select main_a .cse3) (select main_a main_yold)) (= main_y .cse3) (= .cse4 (select main_a .cse5)) (= .cse6 .cse1) (= .cse4 .cse6) (= .cse0 .cse2) (= main_x .cse5) (= 0 (select main_a .cse7))))))) (let ((.cse19 (mod (+ v_subst_5 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse11 (select main_a .cse19)) (.cse14 (select main_a v_subst_5)) (.cse13 (select main_a (+ v_subst_5 (- 1)))) (.cse16 (select main_a .cse17)) (.cse12 (select main_a .cse18)) (.cse15 (mod (+ .cse17 1) 256))) (and (= .cse11 .cse12) (= .cse13 1000) (= .cse14 .cse11) (= main_x .cse15) (= .cse14 .cse13) (= .cse16 (select main_a main_x)) (= .cse16 .cse12) (= main_y (mod (+ .cse15 1) 256)) (= (select main_a main_y) (select main_a v_prenex_39)) (= v_subst_5 (mod v_subst_5 256)))))))) [2018-12-19 12:10:24,391 WARN L181 SmtUtils]: Spent 9.86 s on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-12-19 12:10:31,358 WARN L181 SmtUtils]: Spent 6.77 s on a formula simplification that was a NOOP. DAG size: 106 [2018-12-19 12:10:31,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:31,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:31,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:31,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:31,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:32,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:33,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,091 INFO L303 Elim1Store]: Index analysis took 2712 ms [2018-12-19 12:10:34,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 3 new quantified variables, introduced 17 case distinctions, treesize of input 246 treesize of output 941 [2018-12-19 12:10:34,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:34,549 INFO L303 Elim1Store]: Index analysis took 184 ms [2018-12-19 12:10:34,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 909 treesize of output 1017 [2018-12-19 12:10:34,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:10:38,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:10:38,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:38,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:38,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:39,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:39,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:39,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:39,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:39,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:40,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:40,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:40,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:40,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:40,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:40,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:41,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:41,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:41,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:41,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:41,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:41,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:42,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:42,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:43,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:43,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:43,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:43,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:44,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:44,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:44,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,557 INFO L303 Elim1Store]: Index analysis took 9118 ms [2018-12-19 12:10:47,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 261 treesize of output 932 [2018-12-19 12:10:47,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:47,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 923 treesize of output 1028 [2018-12-19 12:10:47,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:10:53,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:53,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:53,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:53,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:53,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:54,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:55,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:55,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:55,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:55,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:55,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:55,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:10:56,920 INFO L303 Elim1Store]: Index analysis took 3365 ms [2018-12-19 12:10:56,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 1017 [2018-12-19 12:10:56,928 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-19 12:10:58,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:11:32,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 550 [2018-12-19 12:11:32,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:32,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 561 [2018-12-19 12:11:32,907 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-19 12:11:33,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:11:33,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,395 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-12-19 12:11:33,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 197 treesize of output 535 [2018-12-19 12:11:33,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:11:33,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 552 [2018-12-19 12:11:33,527 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-19 12:11:33,897 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:11:36,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-19 12:11:36,419 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:478, output treesize:641 [2018-12-19 12:11:38,524 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:11:38,524 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_34, v_subst_4, main_yold, v_prenex_40, v_prenex_41, v_subst_5]. (or (let ((.cse8 (+ v_subst_4 1))) (let ((.cse10 (mod .cse8 256)) (.cse12 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse9 (mod (+ (mod (+ .cse12 1) 256) 1) 256)) (.cse11 (mod (+ .cse10 1) 256))) (let ((.cse0 (select v_main_a_34 (mod (+ (mod (+ .cse11 1) 256) 1) 256))) (.cse2 (select v_main_a_34 v_subst_4)) (.cse1 (select v_main_a_34 .cse12)) (.cse3 (select v_main_a_34 .cse9)) (.cse6 (select v_main_a_34 .cse11)) (.cse4 (select v_main_a_34 .cse10)) (.cse5 (mod (+ .cse9 1) 256))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse0 .cse3) (= .cse2 .cse4) (= (select v_main_a_34 .cse5) (select v_main_a_34 v_prenex_40)) (= .cse6 .cse1) (= (let ((.cse7 (store v_main_a_34 main_x .cse3))) (store .cse7 main_y (select .cse7 main_yold))) main_a) (= 0 (select v_main_a_34 .cse8)) (= .cse6 .cse4) (= main_x .cse5) (= main_y (mod (+ .cse5 1) 256))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse22 1) 256))) (let ((.cse16 (mod (+ .cse21 1) 256)) (.cse14 (select v_prenex_41 v_subst_5)) (.cse13 (select v_prenex_41 (+ v_subst_5 (- 1)))) (.cse15 (select v_prenex_41 .cse24)) (.cse17 (select v_prenex_41 .cse23)) (.cse19 (select v_prenex_41 .cse22)) (.cse18 (select v_prenex_41 .cse21))) (and (= .cse13 1000) (= .cse14 .cse15) (= main_x .cse16) (= main_y (mod (+ .cse16 1) 256)) (= .cse14 .cse13) (= .cse15 .cse17) (= .cse18 .cse19) (= v_subst_5 (mod v_subst_5 256)) (= .cse17 .cse19) (= (let ((.cse20 (store v_prenex_41 main_x .cse18))) (store .cse20 main_y (select .cse20 main_yold))) main_a)))))))) [2018-12-19 12:11:38,525 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_45, main_yold, v_subst_5, v_prenex_46, v_subst_4]. (let ((.cse3 (select main_a main_x)) (.cse8 (select main_a main_y))) (or (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse12 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse0 (select main_a .cse12)) (.cse6 (select main_a v_subst_5)) (.cse2 (select main_a (+ v_subst_5 (- 1)))) (.cse7 (mod (+ .cse11 1) 256)) (.cse4 (select main_a .cse11)) (.cse5 (select main_a .cse10)) (.cse1 (select main_a .cse9))) (and (= .cse0 .cse1) (= .cse2 1000) (= .cse3 .cse4) (= .cse5 .cse4) (= .cse6 .cse0) (= .cse6 .cse2) (= main_x .cse7) (= main_y (mod (+ .cse7 1) 256)) (= .cse8 .cse4) (= .cse5 .cse1) (= v_subst_5 (mod v_subst_5 256)))))))) (let ((.cse23 (mod (+ v_prenex_45 1) 256))) (let ((.cse20 (mod (+ .cse23 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse22 (mod (+ .cse21 1) 256))) (let ((.cse16 (select main_a .cse22)) (.cse14 (select main_a .cse23)) (.cse18 (select main_a v_prenex_45)) (.cse13 (select main_a (+ v_prenex_45 (- 1)))) (.cse19 (mod (+ .cse22 1) 256)) (.cse17 (select main_a .cse21)) (.cse15 (select main_a .cse20))) (and (= .cse13 1000) (= .cse14 .cse15) (= .cse3 .cse16) (= .cse17 .cse16) (= .cse18 .cse14) (= .cse18 .cse13) (= main_x .cse19) (= main_y (mod (+ .cse19 1) 256)) (= .cse17 .cse15) (= .cse8 (select main_a main_yold)) (= v_prenex_45 (mod v_prenex_45 256)))))))) (let ((.cse31 (+ v_subst_4 1))) (let ((.cse33 (mod .cse31 256)) (.cse34 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse32 (mod (+ (mod (+ .cse34 1) 256) 1) 256)) (.cse35 (mod (+ .cse33 1) 256))) (let ((.cse25 (select main_a .cse35)) (.cse27 (select main_a (mod (+ (mod (+ .cse35 1) 256) 1) 256))) (.cse29 (select main_a .cse34)) (.cse28 (select main_a .cse32)) (.cse24 (select main_a .cse33)) (.cse26 (select main_a v_subst_4)) (.cse30 (mod (+ .cse32 1) 256))) (and (= .cse24 .cse25) (= 1000 .cse26) (= .cse27 .cse28) (= .cse8 (select main_a v_prenex_46)) (= .cse29 .cse25) (= .cse27 .cse29) (= (select main_a .cse30) .cse28) (= main_x .cse30) (= .cse24 .cse26) (= main_y (mod (+ .cse30 1) 256)) (= 0 (select main_a .cse31))))))))) [2018-12-19 12:12:20,188 WARN L181 SmtUtils]: Spent 14.30 s on a formula simplification. DAG size of input: 130 DAG size of output: 85 [2018-12-19 12:12:50,804 WARN L181 SmtUtils]: Spent 30.53 s on a formula simplification that was a NOOP. DAG size: 107 [2018-12-19 12:12:50,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:51,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:51,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:51,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:51,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:51,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:51,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:52,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:52,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:52,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:52,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:52,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:53,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:53,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:53,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:53,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:54,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:54,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:54,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:54,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:54,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:55,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:55,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:55,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:55,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:55,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:56,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:56,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:57,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:57,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:57,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:57,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:57,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:58,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:58,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:58,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:58,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:58,886 INFO L303 Elim1Store]: Index analysis took 8064 ms [2018-12-19 12:12:58,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 271 treesize of output 1023 [2018-12-19 12:12:59,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:12:59,625 INFO L303 Elim1Store]: Index analysis took 654 ms [2018-12-19 12:12:59,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 48 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 256 treesize of output 1360 [2018-12-19 12:12:59,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:13:06,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:13:06,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:07,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:07,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:07,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:07,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:08,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:08,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:08,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:08,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:08,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:09,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:09,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:09,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:09,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:10,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:10,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:10,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:10,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:11,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:11,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:11,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:13,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:13,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:13,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:13,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:13,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:14,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:14,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:14,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:14,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:15,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:15,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:15,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:15,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:15,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:16,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:16,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:16,729 INFO L303 Elim1Store]: Index analysis took 10302 ms [2018-12-19 12:13:16,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 1042 [2018-12-19 12:13:17,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:13:17,153 INFO L303 Elim1Store]: Index analysis took 343 ms [2018-12-19 12:13:17,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 47 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 1373 [2018-12-19 12:13:17,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-19 12:13:23,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:14:12,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,753 INFO L303 Elim1Store]: Index analysis took 250 ms [2018-12-19 12:14:12,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 249 treesize of output 797 [2018-12-19 12:14:12,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:12,938 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-12-19 12:14:12,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 215 treesize of output 1085 [2018-12-19 12:14:12,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-19 12:14:13,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:14:13,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:13,958 INFO L303 Elim1Store]: Index analysis took 238 ms [2018-12-19 12:14:13,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 816 [2018-12-19 12:14:14,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:14:14,163 INFO L303 Elim1Store]: Index analysis took 153 ms [2018-12-19 12:14:14,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 1098 [2018-12-19 12:14:14,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-19 12:14:14,751 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:14:22,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-19 12:14:22,996 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:563, output treesize:515 [2018-12-19 12:14:25,115 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:14:25,116 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_prenex_45, main_yold, v_prenex_47, v_subst_4]. (or (let ((.cse13 (mod (+ v_prenex_45 1) 256))) (let ((.cse11 (mod (+ .cse13 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse12 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse12 1) 256))) (let ((.cse1 (select v_main_a_35 .cse13)) (.cse3 (select v_main_a_35 .cse12)) (.cse7 (select v_main_a_35 .cse9)) (.cse2 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 .cse10)) (.cse6 (mod (+ .cse9 1) 256)) (.cse0 (select v_main_a_35 v_prenex_45)) (.cse8 (select v_main_a_35 (+ v_prenex_45 (- 1))))) (and (= .cse0 .cse1) (= v_prenex_45 (mod v_prenex_45 256)) (= .cse2 .cse1) (= .cse3 .cse4) (= (let ((.cse5 (store v_main_a_35 main_x .cse7))) (store .cse5 (mod (+ .cse6 1) 256) (select .cse5 main_yold))) main_a) (= 1000 .cse8) (= .cse3 .cse7) (= .cse2 .cse4) (= main_x .cse6) (= .cse0 .cse8)))))))) (let ((.cse18 (+ v_subst_4 1)) (.cse25 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse27 (mod (+ (mod (+ .cse25 1) 256) 1) 256)) (.cse26 (mod .cse18 256))) (let ((.cse24 (mod (+ .cse26 1) 256)) (.cse28 (mod (+ .cse27 1) 256))) (let ((.cse16 (mod (+ .cse28 1) 256)) (.cse14 (select v_prenex_47 .cse28)) (.cse17 (select v_prenex_47 v_subst_4)) (.cse15 (select v_prenex_47 .cse27)) (.cse21 (select v_prenex_47 (mod (+ (mod (+ .cse24 1) 256) 1) 256))) (.cse20 (select v_prenex_47 .cse26)) (.cse22 (select v_prenex_47 .cse25)) (.cse23 (select v_prenex_47 .cse24))) (and (= .cse14 .cse15) (= main_x .cse16) (= .cse17 1000) (= (select v_prenex_47 .cse18) 0) (= (let ((.cse19 (store v_prenex_47 main_x .cse14))) (store .cse19 (mod (+ .cse16 1) 256) (select .cse19 main_yold))) main_a) (= .cse17 .cse20) (= .cse21 .cse15) (= .cse22 .cse21) (= .cse23 .cse20) (= .cse22 .cse23))))))) [2018-12-19 12:14:25,116 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_49, v_prenex_45, v_subst_4, main_yold]. (let ((.cse8 (select main_a main_x))) (or (let ((.cse12 (mod (+ v_prenex_45 1) 256))) (let ((.cse13 (mod (+ .cse12 1) 256))) (let ((.cse9 (mod (+ .cse13 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse11 (mod (+ .cse10 1) 256))) (let ((.cse5 (select main_a v_prenex_45)) (.cse1 (select main_a .cse11)) (.cse2 (select main_a .cse13)) (.cse6 (select main_a .cse12)) (.cse4 (mod (+ .cse11 1) 256)) (.cse7 (select main_a (+ v_prenex_45 (- 1)))) (.cse0 (select main_a .cse10)) (.cse3 (select main_a .cse9))) (and (= .cse0 .cse1) (= v_prenex_45 (mod v_prenex_45 256)) (= .cse2 .cse3) (= (select main_a v_prenex_49) (select main_a (mod (+ .cse4 1) 256))) (= .cse5 .cse6) (= .cse5 .cse7) (= .cse8 .cse1) (= .cse2 .cse6) (= main_x .cse4) (= .cse7 1000) (= .cse0 .cse3)))))))) (let ((.cse22 (+ v_subst_4 1)) (.cse26 (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (let ((.cse25 (mod (+ (mod (+ .cse26 1) 256) 1) 256)) (.cse23 (mod .cse22 256))) (let ((.cse27 (mod (+ .cse23 1) 256)) (.cse24 (mod (+ .cse25 1) 256))) (let ((.cse17 (mod (+ .cse24 1) 256)) (.cse15 (select main_a .cse27)) (.cse18 (select main_a (mod (+ (mod (+ .cse27 1) 256) 1) 256))) (.cse20 (select main_a .cse26)) (.cse19 (select main_a .cse25)) (.cse21 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse16 (select main_a v_subst_4))) (and (= .cse14 .cse15) (= 1000 .cse16) (= main_x .cse17) (= (select main_a (mod (+ .cse17 1) 256)) (select main_a main_yold)) (= .cse18 .cse19) (= .cse20 .cse15) (= .cse18 .cse20) (= .cse21 .cse19) (= .cse8 .cse21) (= .cse14 .cse16) (= 0 (select main_a .cse22))))))))) [2018-12-19 12:14:56,193 WARN L181 SmtUtils]: Spent 4.75 s on a formula simplification that was a NOOP. DAG size: 97 [2018-12-19 12:14:56,239 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {317#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2018-12-19 12:14:56,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {321#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is VALID [2018-12-19 12:14:58,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {325#(or (exists ((main_xold Int) (main_yold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))) (exists ((v_subst_4 Int) (v_prenex_21 Int)) (and (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a v_prenex_21)) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} is UNKNOWN [2018-12-19 12:15:00,480 INFO L273 TraceCheckUtils]: 3: Hoare triple {325#(or (exists ((main_xold Int) (main_yold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))) (exists ((v_subst_4 Int) (v_prenex_21 Int)) (and (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a v_prenex_21)) (= main_y (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {329#(or (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} is UNKNOWN [2018-12-19 12:15:02,533 INFO L273 TraceCheckUtils]: 4: Hoare triple {329#(or (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))) (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {333#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))))} is UNKNOWN [2018-12-19 12:15:04,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {337#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} is UNKNOWN [2018-12-19 12:15:06,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_subst_5 Int)) (and (= (select main_a (+ v_subst_5 (- 1))) 1000) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {341#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_45 Int)) (and (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ v_prenex_45 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2018-12-19 12:15:08,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_45 Int)) (and (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ v_prenex_45 1) 256)) (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {345#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_49 Int) (v_prenex_45 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_49) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))))))} is UNKNOWN [2018-12-19 12:15:08,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {345#(or (exists ((main_yold Int) (v_subst_4 Int)) (and (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a v_subst_4)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_yold)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_4 2) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 2) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a v_subst_4)) (= 0 (select main_a (+ v_subst_4 1))))) (exists ((v_prenex_49 Int) (v_prenex_45 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= v_prenex_45 (mod v_prenex_45 256)) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))) (= (select main_a v_prenex_45) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_45) (select main_a (+ v_prenex_45 (- 1)))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256)) (select main_a (mod (+ v_prenex_45 1) 256))) (= (select main_a v_prenex_49) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_prenex_45 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ v_prenex_45 1) 256) 1) 256) 1) 256))))))} assume a[x] == 0; {308#false} is VALID [2018-12-19 12:15:08,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(a[y] == 1000); {308#false} is VALID [2018-12-19 12:15:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 12 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:15:08,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:15:52,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(a[y] == 1000); {308#false} is VALID [2018-12-19 12:15:52,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#(not (= (select main_a main_x) 0))} assume a[x] == 0; {308#false} is VALID [2018-12-19 12:15:52,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {355#(not (= (select main_a main_x) 0))} is VALID [2018-12-19 12:15:52,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,681 INFO L273 TraceCheckUtils]: 4: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,690 INFO L273 TraceCheckUtils]: 3: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,701 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {359#(forall ((v_main_yold_9 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_9)) (mod (+ main_x 1) 256)))))} is VALID [2018-12-19 12:15:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-19 12:15:52,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:15:52,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 3] total 16 [2018-12-19 12:15:52,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:15:52,723 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2018-12-19 12:15:52,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:15:52,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-12-19 12:16:07,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 11 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-12-19 12:16:07,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-19 12:16:07,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-19 12:16:07,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=174, Unknown=36, NotChecked=0, Total=272 [2018-12-19 12:16:07,026 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 15 states. [2018-12-19 12:17:29,274 WARN L181 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-19 12:18:07,617 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-19 12:18:57,363 WARN L181 SmtUtils]: Spent 7.82 s on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-12-19 12:20:00,435 WARN L181 SmtUtils]: Spent 15.41 s on a formula simplification. DAG size of input: 87 DAG size of output: 84