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-f57a05f [2019-01-07 18:21:25,622 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 18:21:25,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 18:21:25,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 18:21:25,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 18:21:25,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 18:21:25,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 18:21:25,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 18:21:25,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 18:21:25,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 18:21:25,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 18:21:25,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 18:21:25,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 18:21:25,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 18:21:25,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 18:21:25,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 18:21:25,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 18:21:25,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 18:21:25,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 18:21:25,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 18:21:25,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 18:21:25,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 18:21:25,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 18:21:25,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 18:21:25,685 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 18:21:25,686 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 18:21:25,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 18:21:25,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 18:21:25,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 18:21:25,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 18:21:25,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 18:21:25,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 18:21:25,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 18:21:25,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 18:21:25,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 18:21:25,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 18:21:25,697 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 [2019-01-07 18:21:25,719 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 18:21:25,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 18:21:25,722 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 18:21:25,722 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 18:21:25,722 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 18:21:25,722 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 18:21:25,723 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 18:21:25,723 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 18:21:25,723 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 18:21:25,724 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 18:21:25,724 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 18:21:25,724 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 18:21:25,724 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 18:21:25,724 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 18:21:25,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 18:21:25,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 18:21:25,725 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 18:21:25,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 18:21:25,726 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 18:21:25,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 18:21:25,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 18:21:25,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 18:21:25,727 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 18:21:25,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 18:21:25,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 18:21:25,727 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 18:21:25,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 18:21:25,727 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 18:21:25,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 18:21:25,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 18:21:25,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 18:21:25,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:21:25,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 18:21:25,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 18:21:25,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 18:21:25,731 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 18:21:25,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 18:21:25,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 18:21:25,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 18:21:25,732 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 18:21:25,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 18:21:25,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 18:21:25,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 18:21:25,783 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 18:21:25,784 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 18:21:25,785 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2019-01-07 18:21:25,785 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-01-07 18:21:25,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 18:21:25,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 18:21:25,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 18:21:25,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 18:21:25,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 18:21:25,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,861 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 18:21:25,861 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 18:21:25,861 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 18:21:25,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 18:21:25,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 18:21:25,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 18:21:25,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 18:21:25,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/1) ... [2019-01-07 18:21:25,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 18:21:25,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 18:21:25,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 18:21:25,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 18:21:25,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (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 [2019-01-07 18:21:25,954 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-07 18:21:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 18:21:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 18:21:26,277 INFO L278 CfgBuilder]: Using library mode [2019-01-07 18:21:26,277 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-07 18:21:26,278 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:21:26 BoogieIcfgContainer [2019-01-07 18:21:26,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 18:21:26,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 18:21:26,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 18:21:26,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 18:21:26,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:21:25" (1/2) ... [2019-01-07 18:21:26,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e92c3de and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 06:21:26, skipping insertion in model container [2019-01-07 18:21:26,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:21:26" (2/2) ... [2019-01-07 18:21:26,286 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-01-07 18:21:26,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 18:21:26,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 18:21:26,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 18:21:26,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 18:21:26,358 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 18:21:26,358 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 18:21:26,358 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 18:21:26,358 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 18:21:26,359 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 18:21:26,359 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 18:21:26,359 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 18:21:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 18:21:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:21:26,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:21:26,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:21:26,384 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:21:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:21:26,391 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-01-07 18:21:26,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:21:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:21:26,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:21:26,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:21:26,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:21:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:21:26,854 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-01-07 18:21:26,941 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 [2019-01-07 18:21:26,946 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 [2019-01-07 18:21:26,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-01-07 18:21:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:21:26,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:21:26,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 18:21:26,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:21:26,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 18:21:26,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:21:26,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 18:21:27,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:21:27,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 18:21:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 18:21:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 18:21:27,015 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-07 18:21:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:21:27,253 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-07 18:21:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 18:21:27,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 18:21:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:21:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:21:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-07 18:21:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:21:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-07 18:21:27,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-01-07 18:21:27,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:21:27,357 INFO L225 Difference]: With dead ends: 15 [2019-01-07 18:21:27,357 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 18:21:27,370 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 [2019-01-07 18:21:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 18:21:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 18:21:27,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:21:27,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 18:21:27,477 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 18:21:27,477 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 18:21:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:21:27,479 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 18:21:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 18:21:27,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:21:27,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:21:27,481 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 18:21:27,482 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 18:21:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:21:27,485 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 18:21:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 18:21:27,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:21:27,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:21:27,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:21:27,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:21:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 18:21:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 18:21:27,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 18:21:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:21:27,492 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 18:21:27,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 18:21:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 18:21:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 18:21:27,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:21:27,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 18:21:27,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:21:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:21:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-01-07 18:21:27,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:21:27,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:21:27,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:21:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:21:27,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:21:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:21:27,872 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 [2019-01-07 18:21:27,882 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 [2019-01-07 18:21:27,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-01-07 18:21:27,897 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-07 18:21:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:21:27,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:21:27,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:21:27,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 18:21:27,901 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-01-07 18:21:27,942 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:21:27,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:21:28,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:21:28,095 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. [2019-01-07 18:21:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:21:28,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:21:28,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:21:28,103 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 [2019-01-07 18:21:28,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:21:28,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:21:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:21:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:21:28,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:21:28,215 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 [2019-01-07 18:21:28,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:28,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:28,310 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 [2019-01-07 18:21:28,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:28,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:28,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:28,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 18:21:28,354 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:21:28,355 WARN L385 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))) [2019-01-07 18:21:28,355 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 18:21:28,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:28,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:28,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:28,723 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 [2019-01-07 18:21:28,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:28,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,075 INFO L303 Elim1Store]: Index analysis took 198 ms [2019-01-07 18:21:29,082 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 [2019-01-07 18:21:29,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:29,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,223 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 [2019-01-07 18:21:29,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:29,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 18:21:29,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,379 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 [2019-01-07 18:21:29,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,425 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 [2019-01-07 18:21:29,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:29,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:29,571 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 [2019-01-07 18:21:29,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:29,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 18:21:29,817 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. [2019-01-07 18:21:29,817 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-01-07 18:21:32,007 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:21:32,007 WARN L385 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))) [2019-01-07 18:21:32,008 WARN L386 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))))))) [2019-01-07 18:21:32,236 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-01-07 18:21:32,396 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 [2019-01-07 18:21:34,418 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 [2019-01-07 18:21:34,433 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 [2019-01-07 18:21:34,434 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-07 18:21:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:21:34,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:21:34,506 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-07 18:21:34,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-01-07 18:21:34,510 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 [2019-01-07 18:21:34,512 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 [2019-01-07 18:21:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:21:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:21:34,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-07 18:21:34,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:21:34,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 18:21:34,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:21:34,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 18:21:36,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-07 18:21:36,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 18:21:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 18:21:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:21:36,582 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-07 18:21:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:21:40,670 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 18:21:40,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 18:21:40,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 18:21:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:21:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:21:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-07 18:21:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:21:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-07 18:21:40,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-01-07 18:21:42,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-07 18:21:42,827 INFO L225 Difference]: With dead ends: 8 [2019-01-07 18:21:42,827 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 18:21:42,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:21:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 18:21:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 18:21:42,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:21:42,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-07 18:21:42,839 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 18:21:42,839 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 18:21:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:21:42,841 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 18:21:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 18:21:42,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:21:42,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:21:42,842 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 18:21:42,842 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 18:21:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:21:42,844 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 18:21:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 18:21:42,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:21:42,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:21:42,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:21:42,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:21:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:21:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-07 18:21:42,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-07 18:21:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:21:42,846 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-07 18:21:42,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 18:21:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 18:21:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 18:21:42,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:21:42,847 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 18:21:42,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:21:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:21:42,847 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-01-07 18:21:42,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:21:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:21:42,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:21:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:21:42,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:21:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:21:43,105 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2019-01-07 18:21:43,291 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 [2019-01-07 18:21:43,297 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 [2019-01-07 18:21:43,299 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 [2019-01-07 18:21:43,310 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-01-07 18:21:43,310 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-07 18:21:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:21:43,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:21:43,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:21:43,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:21:43,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:21:43,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:21:43,312 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 [2019-01-07 18:21:43,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:21:43,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:21:43,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 18:21:43,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:21:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:21:43,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:21:43,394 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 [2019-01-07 18:21:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,407 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 [2019-01-07 18:21:43,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:43,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:43,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:43,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 18:21:43,432 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:21:43,432 WARN L385 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))) [2019-01-07 18:21:43,432 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 18:21:43,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,556 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 [2019-01-07 18:21:43,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,595 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 [2019-01-07 18:21:43,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:43,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,690 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 [2019-01-07 18:21:43,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:43,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 18:21:43,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,765 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 [2019-01-07 18:21:43,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,823 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 [2019-01-07 18:21:43,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:43,979 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 [2019-01-07 18:21:43,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:44,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 18:21:44,122 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. [2019-01-07 18:21:44,122 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-01-07 18:21:46,286 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:21:46,286 WARN L385 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)))) [2019-01-07 18:21:46,287 WARN L386 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)))) [2019-01-07 18:21:46,694 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-01-07 18:21:46,978 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-07 18:21:46,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:46,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,010 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 [2019-01-07 18:21:47,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,047 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 [2019-01-07 18:21:47,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,100 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 [2019-01-07 18:21:47,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,136 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 [2019-01-07 18:21:47,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,436 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 [2019-01-07 18:21:47,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,526 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 [2019-01-07 18:21:47,533 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,621 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 [2019-01-07 18:21:47,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:21:47,652 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 [2019-01-07 18:21:47,667 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,728 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:21:47,971 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. [2019-01-07 18:21:47,972 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-01-07 18:21:50,220 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:21:50,220 WARN L385 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))))))) [2019-01-07 18:21:50,221 WARN L386 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))))) [2019-01-07 18:21:50,600 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-07 18:21:50,627 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 [2019-01-07 18:21:52,641 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 [2019-01-07 18:21:54,688 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 [2019-01-07 18:21:54,728 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 [2019-01-07 18:21:54,729 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-07 18:21:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:21:54,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:21:56,863 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-07 18:21:56,865 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-01-07 18:21:56,866 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 [2019-01-07 18:21:56,871 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 [2019-01-07 18:21:56,874 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 [2019-01-07 18:21:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 18:21:56,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:21:56,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-07 18:21:56,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:21:56,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 18:21:56,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:21:56,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-07 18:22:01,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-07 18:22:01,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 18:22:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 18:22:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 18:22:01,004 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-01-07 18:22:10,410 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-01-07 18:22:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:22:14,676 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-07 18:22:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 18:22:14,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 18:22:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:22:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 18:22:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-07 18:22:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 18:22:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-07 18:22:14,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-01-07 18:22:18,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-07 18:22:18,775 INFO L225 Difference]: With dead ends: 10 [2019-01-07 18:22:18,775 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 18:22:18,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 18:22:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 18:22:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 18:22:18,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:22:18,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-07 18:22:18,809 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 18:22:18,809 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 18:22:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:22:18,811 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 18:22:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 18:22:18,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:22:18,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:22:18,812 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 18:22:18,812 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 18:22:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:22:18,813 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 18:22:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 18:22:18,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:22:18,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:22:18,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:22:18,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:22:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 18:22:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-07 18:22:18,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-07 18:22:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:22:18,815 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-07 18:22:18,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 18:22:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 18:22:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 18:22:18,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:22:18,816 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-07 18:22:18,816 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:22:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:22:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-01-07 18:22:18,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:22:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:22:18,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:22:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:22:18,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:22:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:22:19,577 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-07 18:22:19,689 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 [2019-01-07 18:22:19,700 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 [2019-01-07 18:22:19,702 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 [2019-01-07 18:22:19,704 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 [2019-01-07 18:22:19,705 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 [2019-01-07 18:22:19,706 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 [2019-01-07 18:22:19,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-07 18:22:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:22:19,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:22:19,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:22:19,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:22:19,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:22:19,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:22:19,710 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 [2019-01-07 18:22:19,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:22:19,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:22:19,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:22:19,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:22:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:22:19,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:22:19,903 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 [2019-01-07 18:22:19,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:19,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:19,913 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 [2019-01-07 18:22:19,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:19,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:19,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:19,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 18:22:19,937 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:22:19,937 WARN L385 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)) [2019-01-07 18:22:19,937 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 18:22:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,070 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 [2019-01-07 18:22:20,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,090 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 [2019-01-07 18:22:20,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:20,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:20,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,130 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 [2019-01-07 18:22:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:20,166 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 [2019-01-07 18:22:20,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:20,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:20,252 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. [2019-01-07 18:22:20,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-07 18:22:22,350 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:22:22,350 WARN L385 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))) [2019-01-07 18:22:22,350 WARN L386 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))))) [2019-01-07 18:22:22,866 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-07 18:22:22,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,896 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 [2019-01-07 18:22:22,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:22,923 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 [2019-01-07 18:22:22,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:22,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:23,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,132 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 18:22:23,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,138 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 [2019-01-07 18:22:23,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:23,285 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 [2019-01-07 18:22:23,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:23,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:23,429 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. [2019-01-07 18:22:23,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-07 18:22:25,458 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:22:25,459 WARN L385 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))))) [2019-01-07 18:22:25,459 WARN L386 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)))))) [2019-01-07 18:22:26,237 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-07 18:22:26,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,264 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 [2019-01-07 18:22:26,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,299 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 [2019-01-07 18:22:26,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:26,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:26,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 18:22:26,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,765 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 [2019-01-07 18:22:26,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:26,909 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 [2019-01-07 18:22:26,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:27,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:27,190 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. [2019-01-07 18:22:27,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-01-07 18:22:29,244 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:22:29,245 WARN L385 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)))))) [2019-01-07 18:22:29,245 WARN L386 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)))))) [2019-01-07 18:22:30,633 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-07 18:22:35,897 WARN L181 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-01-07 18:22:35,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:35,991 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 [2019-01-07 18:22:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:36,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:36,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:36,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:36,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:36,102 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 [2019-01-07 18:22:36,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:36,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:40,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:40,852 INFO L303 Elim1Store]: Index analysis took 817 ms [2019-01-07 18:22:40,853 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 [2019-01-07 18:22:41,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:41,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:41,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:41,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:41,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:41,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:22:41,062 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 [2019-01-07 18:22:41,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:22:41,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:22:41,777 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. [2019-01-07 18:22:41,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-01-07 18:22:43,792 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:22:43,793 WARN L385 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)))))) [2019-01-07 18:22:43,793 WARN L386 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))))))) [2019-01-07 18:22:50,665 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-07 18:22:50,722 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 [2019-01-07 18:22:52,728 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 [2019-01-07 18:22:54,740 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 [2019-01-07 18:22:56,752 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 [2019-01-07 18:22:58,764 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 [2019-01-07 18:22:58,771 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 [2019-01-07 18:22:58,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-01-07 18:22:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:22:58,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:23:07,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-07 18:23:07,452 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 [2019-01-07 18:23:07,454 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 [2019-01-07 18:23:07,493 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 [2019-01-07 18:23:08,009 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 [2019-01-07 18:23:08,131 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 [2019-01-07 18:23:08,133 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 [2019-01-07 18:23:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 18:23:08,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:23:08,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-01-07 18:23:08,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:23:08,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 18:23:08,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:23:08,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-07 18:23:16,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 10 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2019-01-07 18:23:16,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 18:23:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 18:23:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2019-01-07 18:23:16,237 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-01-07 18:23:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:23:53,783 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-07 18:23:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 18:23:53,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 18:23:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:23:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 18:23:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-07 18:23:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 18:23:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-07 18:23:53,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2019-01-07 18:24:00,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 15 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-07 18:24:00,530 INFO L225 Difference]: With dead ends: 15 [2019-01-07 18:24:00,530 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 18:24:00,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2019-01-07 18:24:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 18:24:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 18:24:00,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:24:00,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-07 18:24:00,594 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 18:24:00,594 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 18:24:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:24:00,595 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 18:24:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 18:24:00,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:24:00,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:24:00,596 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 18:24:00,596 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 18:24:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:24:00,597 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 18:24:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 18:24:00,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:24:00,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:24:00,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:24:00,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:24:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 18:24:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-07 18:24:00,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-07 18:24:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:24:00,599 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-07 18:24:00,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 18:24:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 18:24:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 18:24:00,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:24:00,600 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-07 18:24:00,600 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:24:00,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:24:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-01-07 18:24:00,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:24:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:24:00,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:24:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:24:00,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:24:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:24:01,575 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-01-07 18:24:01,944 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a main_y)) (<= main_y (+ main_x 1)))} is VALID [2019-01-07 18:24:01,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a 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]]; {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} is VALID [2019-01-07 18:24:01,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 18:24:01,952 INFO L273 TraceCheckUtils]: 3: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 18:24:01,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 18:24:01,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 18:24:01,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (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]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 18:24:01,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (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]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 18:24:01,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (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]]; {319#(not (= 0 (select main_a main_x)))} is VALID [2019-01-07 18:24:01,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2019-01-07 18:24:01,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-07 18:24:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-07 18:24:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:24:01,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:24:01,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:24:01,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:24:01,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:24:01,963 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 [2019-01-07 18:24:01,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:24:01,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:24:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:24:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:24:04,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:24:04,832 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 [2019-01-07 18:24:04,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:04,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:04,849 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 [2019-01-07 18:24:04,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:04,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:04,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:04,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 18:24:04,876 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:24:04,876 WARN L385 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))) [2019-01-07 18:24:04,876 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 18:24:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,004 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 [2019-01-07 18:24:05,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,034 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 [2019-01-07 18:24:05,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:05,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:05,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,078 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 [2019-01-07 18:24:05,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:05,106 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 [2019-01-07 18:24:05,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:05,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:05,188 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. [2019-01-07 18:24:05,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-07 18:24:07,198 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:24:07,199 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_yold]. (let ((.cse0 (select v_main_a_29 (+ main_yold (- 1))))) (and (= 0 (select v_main_a_29 main_yold)) (= .cse0 1000) (= (mod main_yold 256) main_x) (= main_y (mod (+ main_yold 1) 256)) (= (let ((.cse1 (store v_main_a_29 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a))) [2019-01-07 18:24:07,199 WARN L386 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))))) [2019-01-07 18:24:07,495 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-07 18:24:07,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,509 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 [2019-01-07 18:24:07,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,532 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 [2019-01-07 18:24:07,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:07,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:07,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,657 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 18:24:07,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,665 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 130 [2019-01-07 18:24:07,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:07,716 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 55 treesize of output 126 [2019-01-07 18:24:07,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:07,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:07,844 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. [2019-01-07 18:24:07,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-07 18:24:09,875 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:24:09,875 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_16, main_xold, v_main_a_30, v_subst_4]. (or (let ((.cse3 (select v_prenex_16 main_xold)) (.cse0 (select v_prenex_16 (+ main_xold (- 1)))) (.cse1 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 (select v_prenex_16 .cse1)) (= main_x .cse1) (= 1000 .cse0) (= (let ((.cse2 (store v_prenex_16 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1))) main_a) (= .cse3 .cse0) (= main_y (mod (+ .cse1 1) 256)))) (let ((.cse9 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse4 (select v_main_a_30 v_subst_4)) (.cse8 (select v_main_a_30 .cse9)) (.cse6 (select v_main_a_30 (+ v_subst_4 (- 1))))) (and (= .cse4 (select v_main_a_30 .cse5)) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (let ((.cse7 (store v_main_a_30 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse5))) main_a) (= .cse4 0) (= main_x (mod (+ .cse9 1) 256)) (= .cse8 .cse6))))) [2019-01-07 18:24:09,876 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_subst_4]. (or (let ((.cse2 (mod (+ main_xold 1) 256))) (let ((.cse1 (select main_a (+ main_xold (- 1)))) (.cse0 (select main_a main_xold)) (.cse3 (mod (+ .cse2 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= (select main_a main_x) .cse0) (= main_x .cse2) (= main_y .cse3) (= 1000 .cse1) (= .cse0 (select main_a .cse3))))) (let ((.cse7 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse6 (select main_a (+ v_subst_4 (- 1)))) (.cse4 (select main_a .cse7))) (and (= .cse4 (select main_a .cse5)) (= 0 (select main_a v_subst_4)) (= 1000 .cse6) (= main_y (mod (+ .cse5 1) 256)) (= .cse4 .cse6) (= .cse4 (select main_a main_y)) (= main_x (mod (+ .cse7 1) 256)))))) [2019-01-07 18:24:10,975 WARN L181 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-07 18:24:10,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 18:24:11,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,108 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 18:24:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,139 INFO L303 Elim1Store]: Index analysis took 155 ms [2019-01-07 18:24:11,140 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 107 treesize of output 259 [2019-01-07 18:24:11,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,209 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 79 treesize of output 178 [2019-01-07 18:24:11,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:11,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:11,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,630 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 171 [2019-01-07 18:24:11,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:11,691 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 56 treesize of output 127 [2019-01-07 18:24:11,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:11,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:11,953 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. [2019-01-07 18:24:11,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-01-07 18:24:13,964 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:24:13,964 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_17, v_subst_4, v_main_a_31, v_subst_5]. (or (let ((.cse6 (mod v_subst_4 256)) (.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse0 (mod (+ .cse5 1) 256)) (.cse4 (select v_prenex_17 (+ v_subst_4 (- 1)))) (.cse1 (select v_prenex_17 .cse6)) (.cse3 (mod (+ .cse6 1) 256))) (and (= (select v_prenex_17 .cse0) .cse1) (= (let ((.cse2 (store v_prenex_17 main_x (select v_prenex_17 .cse3)))) (store .cse2 main_y (select .cse2 .cse0))) main_a) (= .cse4 1000) (= (select v_prenex_17 .cse5) .cse1) (= (select v_prenex_17 v_subst_4) 0) (= main_y (mod (+ .cse0 1) 256)) (= .cse4 .cse1) (= main_x (mod (+ .cse3 1) 256))))) (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse11 (select v_main_a_31 (+ v_subst_5 (- 1)))) (.cse7 (select v_main_a_31 v_subst_5)) (.cse10 (select v_main_a_31 .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= .cse7 (select v_main_a_31 .cse8)) (= (let ((.cse9 (store v_main_a_31 main_x .cse10))) (store .cse9 main_y (select .cse9 .cse8))) main_a) (= .cse7 .cse11) (= 1000 .cse11) (= .cse7 .cse10) (= main_y (mod (+ .cse8 1) 256)) (= main_x .cse8) (= v_subst_5 (mod v_subst_5 256)))))) [2019-01-07 18:24:13,964 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse2 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_5 1) 256))) (let ((.cse0 (select main_a .cse4)) (.cse3 (select main_a v_subst_5)) (.cse1 (mod (+ .cse4 1) 256))) (and (= .cse0 (select main_a .cse1)) (= .cse0 .cse2) (= .cse3 .cse0) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= .cse3 1000) (= main_y (mod (+ .cse1 1) 256)) (= main_x .cse1) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse9 (mod (+ v_subst_4 1) 256))) (let ((.cse5 (select main_a (mod v_subst_4 256))) (.cse7 (select main_a (+ v_subst_4 (- 1)))) (.cse8 (mod (+ .cse9 1) 256)) (.cse6 (select main_a .cse9))) (and (= .cse5 .cse6) (= 0 (select main_a v_subst_4)) (= 1000 .cse7) (= main_y (mod (+ .cse8 1) 256)) (= .cse5 .cse7) (= .cse6 .cse2) (= main_x .cse8) (= .cse6 (select main_a main_x))))))) [2019-01-07 18:24:16,402 WARN L181 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-07 18:24:19,711 WARN L181 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-07 18:24:19,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,751 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 136 treesize of output 298 [2019-01-07 18:24:19,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:19,801 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 85 treesize of output 214 [2019-01-07 18:24:19,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:19,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:21,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:21,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,019 INFO L303 Elim1Store]: Index analysis took 448 ms [2019-01-07 18:24:22,020 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 142 treesize of output 378 [2019-01-07 18:24:22,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:22,111 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 108 treesize of output 287 [2019-01-07 18:24:22,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:22,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:23,214 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. [2019-01-07 18:24:23,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-01-07 18:24:25,269 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:24:25,270 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_18, v_subst_5, v_main_a_32, v_subst_4]. (or (let ((.cse6 (mod (+ v_subst_5 1) 256))) (let ((.cse5 (mod (+ .cse6 1) 256))) (let ((.cse0 (select v_prenex_18 v_subst_5)) (.cse3 (select v_prenex_18 .cse6)) (.cse2 (select v_prenex_18 .cse5)) (.cse1 (mod (+ .cse5 1) 256))) (and (= .cse0 1000) (= main_x .cse1) (= .cse0 (select v_prenex_18 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= .cse0 .cse3) (= .cse3 (select v_prenex_18 .cse1)) (= (let ((.cse4 (store v_prenex_18 main_x .cse2))) (store .cse4 main_y (select .cse4 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse1 1) 256)))))) (let ((.cse14 (mod (+ v_subst_4 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse8 (select v_main_a_32 (+ v_subst_4 (- 1)))) (.cse10 (select v_main_a_32 (mod v_subst_4 256))) (.cse7 (mod (+ .cse13 1) 256)) (.cse9 (select v_main_a_32 .cse14)) (.cse12 (select v_main_a_32 .cse13))) (and (= (mod (+ .cse7 1) 256) main_y) (= (select v_main_a_32 v_subst_4) 0) (= 1000 .cse8) (= .cse9 .cse10) (= .cse8 .cse10) (= (select v_main_a_32 .cse7) .cse9) (= main_x .cse7) (= (let ((.cse11 (store v_main_a_32 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse7))) main_a) (= .cse9 .cse12)))))) [2019-01-07 18:24:25,270 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse5 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse2 (select main_a v_subst_5)) (.cse1 (select main_a .cse6)) (.cse0 (select main_a .cse7)) (.cse3 (mod (+ .cse6 1) 256))) (and (= .cse0 .cse1) (= .cse2 .cse0) (= .cse2 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse3) (= .cse1 .cse4) (= .cse1 .cse5) (= v_subst_5 (mod v_subst_5 256)) (= .cse0 1000) (= main_y (mod (+ .cse3 1) 256)))))) (let ((.cse13 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse11 (select main_a (+ v_subst_4 (- 1)))) (.cse9 (select main_a .cse13)) (.cse10 (select main_a .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= (mod (+ .cse8 1) 256) main_y) (= .cse9 .cse10) (= 0 (select main_a v_subst_4)) (= 1000 .cse11) (= .cse5 .cse10) (= (select main_a (mod v_subst_4 256)) .cse11) (= .cse9 1000) (= .cse4 .cse10) (= main_x .cse8))))))) [2019-01-07 18:24:36,085 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 64 [2019-01-07 18:24:42,206 WARN L181 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-07 18:24:42,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,409 INFO L303 Elim1Store]: Index analysis took 191 ms [2019-01-07 18:24:42,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 491 [2019-01-07 18:24:42,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:42,595 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 128 treesize of output 367 [2019-01-07 18:24:42,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:47,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:47,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,601 INFO L303 Elim1Store]: Index analysis took 1599 ms [2019-01-07 18:24:48,603 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 0 case distinctions, treesize of input 189 treesize of output 585 [2019-01-07 18:24:48,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:24:48,874 INFO L303 Elim1Store]: Index analysis took 194 ms [2019-01-07 18:24:48,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 450 [2019-01-07 18:24:48,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:24:49,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:24:50,405 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. [2019-01-07 18:24:50,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-01-07 18:24:52,430 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:24:52,430 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, v_prenex_19, v_subst_5]. (or (let ((.cse7 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse6 (mod (+ .cse8 1) 256))) (let ((.cse4 (select v_main_a_33 (+ v_subst_4 (- 1)))) (.cse2 (select v_main_a_33 .cse8)) (.cse1 (select v_main_a_33 .cse7)) (.cse0 (mod (+ .cse6 1) 256)) (.cse3 (select v_main_a_33 .cse6))) (and (= main_y (mod (+ .cse0 1) 256)) (= .cse1 1000) (= .cse2 (select v_main_a_33 .cse0)) (= (select v_main_a_33 v_subst_4) 0) (= .cse2 .cse3) (= (select v_main_a_33 (mod v_subst_4 256)) .cse4) (= .cse0 main_x) (= 1000 .cse4) (= .cse2 .cse1) (= (let ((.cse5 (store v_main_a_33 main_x .cse3))) (store .cse5 main_y (select .cse5 .cse0))) main_a)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse15 1) 256))) (let ((.cse16 (mod (+ .cse17 1) 256))) (let ((.cse10 (select v_prenex_19 .cse17)) (.cse12 (select v_prenex_19 .cse16)) (.cse9 (mod (+ .cse16 1) 256)) (.cse14 (select v_prenex_19 v_subst_5)) (.cse11 (select v_prenex_19 .cse15))) (and (= main_x .cse9) (= .cse10 .cse11) (= (select v_prenex_19 .cse9) .cse10) (= .cse12 .cse10) (= (let ((.cse13 (store v_prenex_19 main_x .cse12))) (store .cse13 main_y (select .cse13 .cse9))) main_a) (= main_y (mod (+ .cse9 1) 256)) (= .cse14 (select v_prenex_19 (+ v_subst_5 (- 1)))) (= 1000 .cse11) (= .cse14 .cse11) (= v_subst_5 (mod v_subst_5 256)))))))) [2019-01-07 18:24:52,431 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse6 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse3 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse3 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse1 (select main_a .cse8)) (.cse2 (select main_a .cse7)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse7 1) 256))) (and (= main_y (mod (+ .cse0 1) 256)) (= 1000 .cse1) (= .cse2 .cse1) (= (select main_a .cse3) .cse1) (= .cse2 .cse4) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= .cse2 .cse6) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse0 main_x)))))) (let ((.cse14 (mod (+ v_subst_5 1) 256))) (let ((.cse16 (mod (+ .cse14 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse10 (select main_a v_subst_5)) (.cse9 (select main_a .cse15)) (.cse13 (select main_a .cse16)) (.cse12 (mod (+ .cse15 1) 256)) (.cse11 (select main_a .cse14))) (and (= .cse9 .cse6) (= .cse10 .cse11) (= main_x .cse12) (= .cse10 (select main_a (+ v_subst_5 (- 1)))) (= .cse13 1000) (= .cse9 .cse4) (= .cse9 .cse13) (= main_y (mod (+ .cse12 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= .cse11 1000)))))))) [2019-01-07 18:25:07,904 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 72 [2019-01-07 18:25:23,725 WARN L181 SmtUtils]: Spent 15.73 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-01-07 18:25:24,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:24,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:24,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:24,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:25,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:26,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:29,695 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (mod v_subst_4 256) v_subst_4) [2019-01-07 18:25:29,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:29,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,459 INFO L303 Elim1Store]: Index analysis took 6718 ms [2019-01-07 18:25:30,460 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 0 case distinctions, treesize of input 252 treesize of output 876 [2019-01-07 18:25:30,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:30,660 INFO L303 Elim1Store]: Index analysis took 145 ms [2019-01-07 18:25:30,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 713 [2019-01-07 18:25:30,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:25:33,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:25:51,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,372 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-07 18:25:51,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 746 [2019-01-07 18:25:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:25:51,492 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 169 treesize of output 574 [2019-01-07 18:25:51,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:25:51,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:25:53,738 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. [2019-01-07 18:25:53,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2019-01-07 18:25:55,769 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:25:55,770 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_20, v_subst_5, v_main_a_34, v_subst_4]. (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse2 (select v_prenex_20 v_subst_5)) (.cse1 (mod (+ .cse10 1) 256)) (.cse5 (select v_prenex_20 .cse10)) (.cse4 (select v_prenex_20 .cse9)) (.cse0 (select v_prenex_20 .cse8)) (.cse3 (select v_prenex_20 .cse7))) (and (= .cse0 (select v_prenex_20 .cse1)) (= main_x .cse1) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 (select v_prenex_20 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= 1000 .cse4) (= .cse0 .cse5) (= (let ((.cse6 (store v_prenex_20 main_x .cse5))) (store .cse6 main_y (select .cse6 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 .cse0) (= .cse3 1000))))))) (let ((.cse17 (mod (+ v_subst_4 1) 256))) (let ((.cse18 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse18 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse11 (select v_main_a_34 .cse20)) (.cse14 (mod (+ .cse20 1) 256)) (.cse12 (select v_main_a_34 .cse19)) (.cse13 (select v_main_a_34 .cse18)) (.cse15 (select v_main_a_34 (+ v_subst_4 (- 1))))) (and (= .cse11 .cse12) (= .cse13 .cse12) (= main_y (mod (+ .cse14 1) 256)) (= .cse15 1000) (= (select v_main_a_34 v_subst_4) 0) (= .cse13 1000) (= main_a (let ((.cse16 (store v_main_a_34 main_x .cse11))) (store .cse16 main_y (select .cse16 .cse14)))) (= main_x .cse14) (= (select v_main_a_34 .cse14) .cse12) (= .cse13 (select v_main_a_34 .cse17)) (= .cse15 (select v_main_a_34 (mod v_subst_4 256)))))))))) [2019-01-07 18:25:55,770 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse0 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a v_subst_5)) (.cse5 (mod (+ .cse10 1) 256)) (.cse1 (select main_a .cse10)) (.cse2 (select main_a .cse9)) (.cse6 (select main_a .cse8)) (.cse4 (select main_a .cse7))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 .cse4) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse5) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (select main_a main_y) .cse1) (= .cse2 .cse6) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 1000))))))) (let ((.cse11 (mod (+ v_subst_4 1) 256))) (let ((.cse20 (mod (+ .cse11 1) 256))) (let ((.cse19 (mod (+ .cse20 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse12 (select main_a .cse20)) (.cse16 (select main_a (+ v_subst_4 (- 1)))) (.cse13 (select main_a .cse19)) (.cse15 (select main_a .cse18)) (.cse14 (mod (+ .cse17 1) 256))) (and (= (select main_a .cse11) .cse12) (= .cse13 .cse12) (= 1000 .cse12) (= main_y .cse14) (= 0 (select main_a v_subst_4)) (= .cse15 .cse0) (= 1000 .cse16) (= (select main_a (mod v_subst_4 256)) .cse16) (= main_x .cse17) (= .cse13 .cse15) (= .cse15 (select main_a .cse14))))))))))) [2019-01-07 18:26:25,011 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-07 18:26:46,489 WARN L181 SmtUtils]: Spent 21.35 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-07 18:26:46,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:46,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:46,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:46,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:47,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:49,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,485 INFO L303 Elim1Store]: Index analysis took 3979 ms [2019-01-07 18:26:50,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 1173 [2019-01-07 18:26:50,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:26:50,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 1238 [2019-01-07 18:26:50,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:26:55,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:27:33,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:33,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,018 INFO L303 Elim1Store]: Index analysis took 274 ms [2019-01-07 18:27:34,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 1091 [2019-01-07 18:27:34,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:27:34,396 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 224 treesize of output 863 [2019-01-07 18:27:34,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:27:35,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:27:42,917 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. [2019-01-07 18:27:42,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:689, output treesize:557 [2019-01-07 18:27:44,942 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:27:44,943 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_subst_4, v_prenex_21, v_subst_5]. (or (let ((.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse9 (mod (+ .cse11 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse7 (select v_main_a_35 .cse10)) (.cse0 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 (+ v_subst_4 (- 1)))) (.cse2 (mod (+ .cse10 1) 256)) (.cse1 (select v_main_a_35 .cse9)) (.cse3 (select v_main_a_35 .cse8))) (and (= .cse0 .cse1) (= (select v_main_a_35 .cse2) .cse3) (= .cse4 (select v_main_a_35 (mod v_subst_4 256))) (= .cse0 (select v_main_a_35 .cse5)) (= (select v_main_a_35 v_subst_4) 0) (= main_x .cse2) (= (let ((.cse6 (store v_main_a_35 main_x .cse7))) (store .cse6 main_y (select .cse6 .cse2))) main_a) (= .cse7 .cse3) (= .cse0 1000) (= .cse4 1000) (= main_y (mod (+ .cse2 1) 256)) (= .cse1 .cse3)))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse20 (mod (+ .cse22 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse12 (select v_prenex_21 .cse24)) (.cse13 (mod (+ .cse21 1) 256)) (.cse15 (select v_prenex_21 .cse23)) (.cse17 (select v_prenex_21 v_subst_5)) (.cse16 (select v_prenex_21 .cse22)) (.cse19 (select v_prenex_21 .cse21)) (.cse14 (select v_prenex_21 .cse20))) (and (= .cse12 1000) (= (select v_prenex_21 .cse13) .cse14) (= .cse15 .cse16) (= .cse12 .cse17) (= (mod (+ .cse13 1) 256) main_y) (= main_x .cse13) (= main_a (let ((.cse18 (store v_prenex_21 main_x .cse19))) (store .cse18 main_y (select .cse18 .cse13)))) (= 1000 .cse15) (= .cse17 (select v_prenex_21 (+ v_subst_5 (- 1)))) (= .cse14 .cse16) (= .cse19 .cse14) (= v_subst_5 (mod v_subst_5 256)))))))))) [2019-01-07 18:27:44,943 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse7 (select main_a main_y))) (or (let ((.cse2 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse2 1) 256))) (let ((.cse4 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse4 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a .cse10)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse8 1) 256)) (.cse6 (select main_a .cse9)) (.cse1 (select main_a .cse8))) (and (= (select main_a .cse0) .cse1) (= (select main_a .cse2) .cse3) (= (select main_a .cse4) .cse3) (= 1000 .cse3) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= main_x .cse0) (= .cse6 1000) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse7 .cse1) (= main_y (mod (+ .cse0 1) 256)) (= .cse6 .cse1)))))))) (let ((.cse18 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse21 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse21 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse12 (select main_a v_subst_5)) (.cse15 (mod (+ .cse20 1) 256)) (.cse14 (select main_a .cse21)) (.cse16 (select main_a .cse20)) (.cse11 (select main_a .cse19)) (.cse13 (select main_a .cse18))) (and (= 1000 .cse11) (= .cse12 .cse13) (= .cse14 .cse11) (= .cse12 (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse15 1) 256) main_y) (= main_x .cse15) (= .cse16 (select main_a main_x)) (= .cse14 (select main_a .cse17)) (= .cse16 .cse7) (= .cse16 .cse11) (= v_subst_5 (mod v_subst_5 256)) (= .cse13 1000)))))))))) [2019-01-07 18:28:20,121 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 89 [2019-01-07 18:28:58,593 WARN L181 SmtUtils]: Spent 38.28 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-01-07 18:28:59,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:00,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:00,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:01,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:01,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:01,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:01,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:01,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:02,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:02,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:02,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:02,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:03,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:03,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:03,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:03,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:03,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:04,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:04,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:04,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:05,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:05,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:06,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:06,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:06,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:06,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:06,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:08,816 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= v_subst_4 (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) [2019-01-07 18:29:08,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:08,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:09,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:10,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,757 INFO L303 Elim1Store]: Index analysis took 13141 ms [2019-01-07 18:29:11,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 1732 [2019-01-07 18:29:11,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:11,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:12,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:12,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:29:12,338 INFO L303 Elim1Store]: Index analysis took 475 ms [2019-01-07 18:29:12,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 57 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 1417 [2019-01-07 18:29:12,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 18:29:26,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:30:07,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,380 INFO L303 Elim1Store]: Index analysis took 366 ms [2019-01-07 18:30:07,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 1540 [2019-01-07 18:30:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:30:07,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 1248 [2019-01-07 18:30:07,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 18:30:08,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:30:18,130 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. [2019-01-07 18:30:18,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:841, output treesize:653 [2019-01-07 18:30:20,171 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:30:20,172 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_subst_4, v_main_a_36, v_subst_5]. (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse6 1) 256))) (let ((.cse5 (mod (+ .cse12 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse9 (mod (+ .cse10 1) 256))) (let ((.cse4 (select v_prenex_22 (+ v_subst_4 (- 1)))) (.cse0 (select v_prenex_22 .cse12)) (.cse2 (select v_prenex_22 .cse11)) (.cse1 (mod (+ .cse9 1) 256)) (.cse3 (select v_prenex_22 .cse10)) (.cse8 (select v_prenex_22 .cse9))) (and (= 1000 .cse0) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 .cse3) (= .cse3 (select v_prenex_22 .cse1)) (= main_x .cse1) (= .cse4 (select v_prenex_22 (mod v_subst_4 256))) (= 0 (select v_prenex_22 v_subst_4)) (= (select v_prenex_22 .cse5) .cse0) (= .cse4 1000) (= .cse0 (select v_prenex_22 .cse6)) (= .cse2 1000) (= (let ((.cse7 (store v_prenex_22 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse1))) main_a) (= .cse3 .cse8))))))))) (let ((.cse25 (mod (+ v_subst_5 1) 256))) (let ((.cse21 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse26 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse26 1) 256))) (let ((.cse15 (select v_main_a_36 .cse26)) (.cse18 (select v_main_a_36 v_subst_5)) (.cse13 (select v_main_a_36 .cse25)) (.cse17 (mod (+ .cse24 1) 256)) (.cse14 (select v_main_a_36 .cse24)) (.cse20 (select v_main_a_36 .cse23)) (.cse16 (select v_main_a_36 .cse22))) (and (= 1000 .cse13) (= .cse14 .cse15) (= .cse15 .cse16) (= .cse17 main_x) (= (select v_main_a_36 (+ v_subst_5 (- 1))) .cse18) (= (select v_main_a_36 .cse17) .cse15) (= .cse18 .cse13) (= main_y (mod (+ .cse17 1) 256)) (= 1000 .cse16) (= (let ((.cse19 (store v_main_a_36 main_x .cse14))) (store .cse19 main_y (select .cse19 .cse17))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse20 (select v_main_a_36 .cse21)) (= .cse20 .cse16)))))))))) [2019-01-07 18:30:20,172 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse2 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse6 1) 256))) (let ((.cse8 (mod (+ .cse10 1) 256))) (let ((.cse5 (mod (+ .cse8 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse12 (mod (+ .cse11 1) 256))) (let ((.cse0 (mod (+ .cse12 1) 256)) (.cse3 (select main_a .cse12)) (.cse1 (select main_a .cse11)) (.cse7 (select main_a .cse10)) (.cse9 (select main_a (+ v_subst_4 (- 1))))) (and (= main_y (mod (+ .cse0 1) 256)) (= main_x .cse0) (= 1000 .cse1) (= .cse2 .cse3) (= .cse4 .cse3) (= (select main_a .cse5) .cse1) (= .cse3 .cse1) (= (select main_a .cse6) .cse7) (= (select main_a .cse8) .cse7) (= 1000 .cse7) (= 0 (select main_a v_subst_4)) (= 1000 .cse9) (= (select main_a (mod v_subst_4 256)) .cse9))))))))) (let ((.cse21 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse20 1) 256))) (let ((.cse25 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse13 (select main_a .cse25)) (.cse15 (mod (+ .cse23 1) 256)) (.cse18 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse17 (select main_a v_subst_5)) (.cse16 (select main_a .cse22)) (.cse19 (select main_a .cse21))) (and (= 1000 .cse13) (= .cse2 .cse14) (= .cse4 .cse14) (= .cse15 main_x) (= .cse16 .cse13) (= .cse17 (select main_a (+ v_subst_5 (- 1)))) (= .cse18 1000) (= main_y (mod (+ .cse15 1) 256)) (= .cse18 .cse14) (= .cse17 .cse19) (= .cse16 (select main_a .cse20)) (= v_subst_5 (mod v_subst_5 256)) (= .cse19 1000))))))))))) [2019-01-07 18:30:54,747 WARN L181 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 96 [2019-01-07 18:30:54,869 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {323#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-07 18:30:55,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#(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]]; {327#(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 VALID [2019-01-07 18:30:57,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#(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]]; {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (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 [2019-01-07 18:30:59,045 INFO L273 TraceCheckUtils]: 3: Hoare triple {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (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]]; {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (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)))) (= (select main_a v_subst_5) 1000) (= 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)))))} is UNKNOWN [2019-01-07 18:31:01,059 INFO L273 TraceCheckUtils]: 4: Hoare triple {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (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)))) (= (select main_a v_subst_5) 1000) (= 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)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {339#(or (exists ((v_subst_5 Int)) (and (= (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)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (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)))))} is UNKNOWN [2019-01-07 18:31:03,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#(or (exists ((v_subst_5 Int)) (and (= (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)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (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)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 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 (+ v_subst_5 1) 256) 1) 256)) 1000) (= (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)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} is UNKNOWN [2019-01-07 18:31:05,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 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 (+ v_subst_5 1) 256) 1) 256)) 1000) (= (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)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {347#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (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 main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 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 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (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))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (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))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-07 18:31:07,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {347#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (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 main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 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 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (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))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (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))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {351#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (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)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (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 (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-07 18:31:09,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (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)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (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 (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {355#(or (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 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 (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-07 18:31:09,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#(or (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 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 (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 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 (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 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 (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} assume a[x] == 0; {314#false} is VALID [2019-01-07 18:31:09,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-07 18:31:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 22 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:31:09,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:31:31,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {314#false} is VALID [2019-01-07 18:31:31,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {362#(= (select main_a main_y) 1000)} is VALID [2019-01-07 18:31:31,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(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]]; {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-01-07 18:31:31,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(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]]; {370#(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 [2019-01-07 18:31:31,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(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]]; {374#(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 [2019-01-07 18:31:32,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(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]]; {374#(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 [2019-01-07 18:31:32,213 INFO L273 TraceCheckUtils]: 4: Hoare triple {374#(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]]; {374#(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 [2019-01-07 18:31:34,217 INFO L273 TraceCheckUtils]: 3: Hoare triple {374#(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]]; {374#(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 UNKNOWN [2019-01-07 18:31:34,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#(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]]; {374#(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 [2019-01-07 18:31:34,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#(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]]; {374#(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 [2019-01-07 18:31:34,610 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {374#(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 [2019-01-07 18:31:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 18:31:34,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:31:34,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2019-01-07 18:31:34,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:31:34,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-07 18:31:34,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:31:34,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-07 18:31:50,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 11 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2019-01-07 18:31:50,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 18:31:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 18:31:50,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=213, Unknown=47, NotChecked=0, Total=380 [2019-01-07 18:31:50,800 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-07 18:34:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:34:44,816 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-07 18:34:44,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 18:34:44,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-07 18:34:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:34:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:34:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 18:34:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:34:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 18:34:44,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 14 transitions. [2019-01-07 18:34:59,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 7 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2019-01-07 18:34:59,491 INFO L225 Difference]: With dead ends: 13 [2019-01-07 18:34:59,491 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 18:34:59,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 136.9s TimeCoverageRelationStatistics Valid=120, Invalid=213, Unknown=47, NotChecked=0, Total=380 [2019-01-07 18:34:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 18:34:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 18:34:59,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:34:59,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 18:34:59,493 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 18:34:59,493 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 18:34:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:34:59,493 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 18:34:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 18:34:59,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:34:59,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:34:59,494 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 18:34:59,494 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 18:34:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:34:59,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 18:34:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 18:34:59,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:34:59,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:34:59,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:34:59,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:34:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 18:34:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 18:34:59,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-07 18:34:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:34:59,496 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 18:34:59,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 18:34:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 18:34:59,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:34:59,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 18:35:19,138 WARN L181 SmtUtils]: Spent 19.59 s on a formula simplification. DAG size of input: 374 DAG size of output: 35 [2019-01-07 18:35:19,147 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 9 30) no Hoare annotation was computed. [2019-01-07 18:35:19,147 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-07 18:35:19,147 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 9 30) no Hoare annotation was computed. [2019-01-07 18:35:19,147 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 30) no Hoare annotation was computed. [2019-01-07 18:35:19,148 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 28) no Hoare annotation was computed. [2019-01-07 18:35:19,148 INFO L444 ceAbstractionStarter]: At program point L18-1(lines 18 29) the Hoare annotation is: (let ((.cse0 (select main_a main_x)) (.cse1 (select main_a main_y))) (or (and (= .cse0 1000) (= .cse1 0) (= main_y (+ main_x 1))) (and (= .cse0 .cse1) (not (= 0 .cse1))) (exists ((main_yold Int)) (let ((.cse2 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse2) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) .cse2) (= (select main_a main_x) .cse3) (= 1000 .cse3)))))) [2019-01-07 18:35:19,150 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-07 18:35:21,156 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-07 18:35:21,157 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-01-07 18:35:21,157 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-07 18:35:21,157 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2019-01-07 18:35:21,157 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2019-01-07 18:35:21,157 INFO L163 areAnnotationChecker]: CFG has 1 edges. 0 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-07 18:35:21,165 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 06:35:21 BoogieIcfgContainer [2019-01-07 18:35:21,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 18:35:21,166 INFO L168 Benchmark]: Toolchain (without parser) took 835342.36 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 989.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -582.3 MB). Peak memory consumption was 407.6 MB. Max. memory is 7.1 GB. [2019-01-07 18:35:21,167 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:35:21,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:35:21,167 INFO L168 Benchmark]: Boogie Preprocessor took 22.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:35:21,168 INFO L168 Benchmark]: RCFGBuilder took 391.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 18:35:21,168 INFO L168 Benchmark]: TraceAbstraction took 834885.45 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 989.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -603.4 MB). Peak memory consumption was 386.5 MB. Max. memory is 7.1 GB. [2019-01-07 18:35:21,170 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 391.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 834885.45 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 989.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -603.4 MB). Peak memory consumption was 386.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((a[x] == 1000 && a[y] == 0) && y == x + 1) || (a[x] == a[y] && !(0 == a[y]))) || (exists main_yold : int :: ((((main_yold % 256 == x && 0 == a[main_yold]) && y == (main_yold + 1) % 256) && a[y] == a[main_yold]) && a[x] == a[main_yold + -1]) && 1000 == a[main_yold + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 832.8s OverallTime, 5 OverallIterations, 8 TraceHistogramMax, 257.3s AutomataDifference, 0.0s DeadEndRemovalTime, 19.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 76 SolverSat, 9 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 114.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 150.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 73 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 3453 FormulaSimplificationTreeSizeReductionInter, 19.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 521.8s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 18 QuantifiedInterpolants, 58064 SizeOfPredicates, 38 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 32/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...