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-fa1c628-m [2019-01-31 14:36:45,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:36:45,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:36:45,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:36:45,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:36:45,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:36:45,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:36:45,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:36:45,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:36:45,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:36:45,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:36:45,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:36:45,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:36:45,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:36:45,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:36:45,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:36:45,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:36:45,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:36:45,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:36:45,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:36:45,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:36:45,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:36:45,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:36:45,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:36:45,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:36:45,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:36:45,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:36:45,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:36:45,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:36:45,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:36:45,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:36:45,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:36:45,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:36:45,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:36:45,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:36:45,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:36:45,714 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-31 14:36:45,726 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:36:45,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:36:45,728 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:36:45,728 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:36:45,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:36:45,728 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:36:45,728 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:36:45,729 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:36:45,729 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:36:45,729 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:36:45,729 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:36:45,729 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:36:45,729 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:36:45,730 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:36:45,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:36:45,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:36:45,731 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:36:45,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:36:45,731 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:36:45,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:36:45,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:36:45,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:36:45,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:36:45,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:36:45,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:36:45,733 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:36:45,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:36:45,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:36:45,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:36:45,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:36:45,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:36:45,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:36:45,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:36:45,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:36:45,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:36:45,734 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:36:45,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:36:45,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:36:45,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:36:45,735 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:36:45,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:36:45,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:36:45,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:36:45,789 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:36:45,789 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:36:45,790 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-31 14:36:45,790 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-01-31 14:36:45,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:36:45,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:36:45,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:36:45,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:36:45,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:36:45,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,879 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:36:45,879 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:36:45,879 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:36:45,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:36:45,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:36:45,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:36:45,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:36:45,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... [2019-01-31 14:36:45,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:36:45,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:36:45,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:36:45,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:36:45,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:36:45,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 14:36:45,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 14:36:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 14:36:46,228 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:36:46,229 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 14:36:46,230 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:36:46 BoogieIcfgContainer [2019-01-31 14:36:46,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:36:46,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:36:46,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:36:46,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:36:46,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:36:45" (1/2) ... [2019-01-31 14:36:46,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5ddd06 and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:36:46, skipping insertion in model container [2019-01-31 14:36:46,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:36:46" (2/2) ... [2019-01-31 14:36:46,238 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-01-31 14:36:46,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:36:46,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:36:46,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:36:46,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:36:46,308 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:36:46,308 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:36:46,308 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:36:46,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:36:46,309 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:36:46,309 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:36:46,309 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:36:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 14:36:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:36:46,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:36:46,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:36:46,335 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:36:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:36:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-01-31 14:36:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:36:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:36:46,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:36:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:36:46,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:36:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:36:46,770 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-01-31 14:36:46,880 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-31 14:36:46,886 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-31 14:36:46,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-01-31 14:36:46,889 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-31 14:36:46,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:36:46,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:36:46,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:36:46,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:36:46,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:36:46,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:36:46,929 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-31 14:36:46,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:36:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:36:46,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:36:46,939 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-31 14:36:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:36:47,167 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-31 14:36:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:36:47,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:36:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:36:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:36:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-31 14:36:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:36:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-31 14:36:47,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-01-31 14:36:47,276 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-31 14:36:47,289 INFO L225 Difference]: With dead ends: 15 [2019-01-31 14:36:47,290 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 14:36:47,293 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-31 14:36:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 14:36:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 14:36:47,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:36:47,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 14:36:47,378 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:36:47,378 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:36:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:36:47,380 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:36:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:36:47,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:36:47,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:36:47,381 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:36:47,381 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:36:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:36:47,382 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:36:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:36:47,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:36:47,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:36:47,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:36:47,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:36:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:36:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 14:36:47,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 14:36:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:36:47,387 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 14:36:47,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:36:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:36:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:36:47,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:36:47,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:36:47,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:36:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:36:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-01-31 14:36:47,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:36:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:36:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:36:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:36:47,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:36:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:36:47,698 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-31 14:36:47,714 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-31 14:36:47,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-01-31 14:36:47,724 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-31 14:36:47,725 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-31 14:36:47,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:36:47,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:36:47,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 14:36:47,729 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-01-31 14:36:47,768 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:36:47,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:36:47,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:36:47,901 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-31 14:36:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:36:47,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:36:47,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:36:47,908 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-31 14:36:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:36:47,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:36:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:36:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:36:47,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:36:48,020 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-31 14:36:48,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,128 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-31 14:36:48,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:36:48,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:36:48,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:36:48,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-31 14:36:48,192 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:36:48,193 WARN L398 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-31 14:36:48,193 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-31 14:36:48,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2019-01-31 14:36:48,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:48,898 INFO L303 Elim1Store]: Index analysis took 199 ms [2019-01-31 14:36:48,907 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-31 14:36:48,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:36:49,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,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, 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-31 14:36:49,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 14:36:49,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 14:36:49,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,279 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-31 14:36:49,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,335 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-31 14:36:49,346 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 14:36:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:36:49,442 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-31 14:36:49,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 14:36:49,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 14:36:49,708 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-31 14:36:49,708 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-01-31 14:37:01,186 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:37:01,187 WARN L398 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-31 14:37:01,187 WARN L399 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-31 14:37:01,565 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-01-31 14:37:01,652 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-31 14:37:11,735 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-31 14:37:11,770 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-31 14:37:11,771 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-31 14:37:11,771 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-31 14:37:11,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:37:11,952 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-31 14:37:11,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-01-31 14:37:11,954 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-31 14:37:11,956 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-31 14:37:11,957 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-31 14:37:11,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:37:11,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-31 14:37:11,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:37:11,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 14:37:11,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:37:11,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:37:22,043 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-31 14:37:22,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:37:22,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:37:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:37:22,044 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-31 14:37:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:37:42,250 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:37:42,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:37:42,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 14:37:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:37:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:37:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-31 14:37:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:37:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-31 14:37:42,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-01-31 14:37:52,310 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-31 14:37:52,311 INFO L225 Difference]: With dead ends: 8 [2019-01-31 14:37:52,311 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 14:37:52,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:37:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 14:37:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 14:37:52,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:37:52,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-31 14:37:52,322 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:37:52,322 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:37:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:37:52,324 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:37:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:37:52,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:37:52,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:37:52,324 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:37:52,325 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:37:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:37:52,326 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:37:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:37:52,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:37:52,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:37:52,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:37:52,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:37:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:37:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 14:37:52,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 14:37:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:37:52,328 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 14:37:52,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 14:37:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:37:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:37:52,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:37:52,329 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 14:37:52,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:37:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:37:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-01-31 14:37:52,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:37:52,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:37:52,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:37:52,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:37:52,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:37:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:37:52,623 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-31 14:37:52,633 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-31 14:37:52,635 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-31 14:37:52,637 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-01-31 14:37:52,637 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-31 14:37:52,638 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-31 14:37:52,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:37:52,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:37:52,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:37:52,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:37:52,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:37:52,639 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-31 14:37:52,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:37:52,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:37:52,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:37:52,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:37:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:37:52,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:37:52,687 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-31 14:37:52,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,696 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-31 14:37:52,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:37:52,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:37:52,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:37:52,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-31 14:37:52,719 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:37:52,720 WARN L398 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-31 14:37:52,720 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-31 14:37:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,845 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-31 14:37:52,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,875 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-31 14:37:52,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:37:52,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:52,975 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-31 14:37:52,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 14:37:53,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 14:37:53,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,056 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-31 14:37:53,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,101 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-31 14:37:53,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 14:37:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:53,260 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-31 14:37:53,267 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 14:37:53,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 14:37:53,421 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-31 14:37:53,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-01-31 14:38:05,124 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:38:05,124 WARN L398 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-31 14:38:05,125 WARN L399 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-31 14:38:05,587 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-01-31 14:38:05,906 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-31 14:38:05,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:05,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:05,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:05,943 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-31 14:38:05,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:05,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:05,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:05,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,010 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-31 14:38:06,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:06,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:06,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,077 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-31 14:38:06,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:06,121 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-31 14:38:06,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:06,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:16,489 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= main_yold v_subst_1) [2019-01-31 14:38:16,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,511 INFO L303 Elim1Store]: Index analysis took 10060 ms [2019-01-31 14:38:16,517 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-31 14:38:16,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,595 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-31 14:38:16,600 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:16,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:16,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,687 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-31 14:38:16,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:16,740 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-31 14:38:16,746 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:16,809 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:16,968 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-31 14:38:16,969 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-01-31 14:38:28,749 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:38:28,749 WARN L398 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-31 14:38:28,749 WARN L399 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-31 14:38:29,474 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-31 14:38:29,514 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-31 14:38:36,070 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 VALID [2019-01-31 14:38:46,179 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-31 14:38:46,260 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-31 14:38:46,260 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-31 14:38:46,261 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-31 14:38:46,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:38:56,549 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-31 14:38:56,550 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-01-31 14:38:56,551 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-31 14:38:56,557 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-31 14:38:56,559 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-31 14:38:56,560 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-31 14:38:56,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:38:56,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-31 14:38:56,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:38:56,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 14:38:56,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:38:56,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 14:39:16,824 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-31 14:39:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 14:39:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 14:39:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 14:39:16,826 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-01-31 14:39:59,065 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-01-31 14:40:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:40:19,449 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-31 14:40:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 14:40:19,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 14:40:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:40:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:40:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-31 14:40:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:40:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-31 14:40:19,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-01-31 14:40:39,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-31 14:40:39,247 INFO L225 Difference]: With dead ends: 10 [2019-01-31 14:40:39,247 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 14:40:39,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 14:40:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 14:40:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 14:40:39,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:40:39,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-31 14:40:39,275 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-31 14:40:39,275 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-31 14:40:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:40:39,277 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:40:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:40:39,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:40:39,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:40:39,278 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-31 14:40:39,278 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-31 14:40:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:40:39,280 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:40:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:40:39,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:40:39,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:40:39,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:40:39,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:40:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:40:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 14:40:39,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-31 14:40:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:40:39,281 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 14:40:39,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 14:40:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:40:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 14:40:39,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:40:39,282 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-31 14:40:39,282 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:40:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:40:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-01-31 14:40:39,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:40:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:40:39,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:40:39,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:40:39,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:40:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:40:40,032 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-31 14:40:40,126 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-31 14:40:40,134 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-31 14:40:40,136 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-31 14:40:40,138 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-31 14:40:40,139 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-31 14:40:40,140 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-31 14:40:40,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-31 14:40:40,142 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-31 14:40:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:40:40,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:40:40,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:40:40,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:40:40,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:40:40,144 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-31 14:40:40,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 14:40:40,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 14:40:40,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 14:40:40,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:40:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:40:40,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:40:40,425 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-31 14:40:40,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,477 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-31 14:40:40,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-31 14:40:40,504 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:40:40,504 WARN L398 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-31 14:40:40,504 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-31 14:40:40,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,626 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-31 14:40:40,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,643 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-31 14:40:40,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,681 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-31 14:40:40,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:40,720 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-31 14:40:40,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:40:40,805 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-31 14:40:40,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-31 14:40:51,434 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:40:51,434 WARN L398 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-31 14:40:51,434 WARN L399 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-31 14:40:51,952 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-31 14:40:51,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,971 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-31 14:40:51,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:51,997 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-31 14:40:52,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:40:52,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:40:52,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 14:40:52,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,226 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-31 14:40:52,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:40:52,384 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-31 14:40:52,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:40:52,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:40:52,553 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-31 14:40:52,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-31 14:41:02,658 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:41:02,659 WARN L398 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-31 14:41:02,659 WARN L399 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-31 14:41:03,319 WARN L181 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-31 14:41:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,347 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-31 14:41:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,385 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-31 14:41:03,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:41:03,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:41:03,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 14:41:03,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:03,942 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-31 14:41:04,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:04,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:04,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:04,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:04,136 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-31 14:41:04,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:41:04,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:41:04,487 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-31 14:41:04,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-01-31 14:41:14,634 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:41:14,635 WARN L398 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-31 14:41:14,635 WARN L399 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-31 14:41:15,105 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-31 14:41:18,381 WARN L181 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-01-31 14:41:18,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,449 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-31 14:41:18,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:18,545 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-31 14:41:18,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:41:18,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:41:20,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,413 INFO L303 Elim1Store]: Index analysis took 338 ms [2019-01-31 14:41:20,414 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-31 14:41:20,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:41:20,633 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-31 14:41:20,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:41:21,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:41:21,447 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-31 14:41:21,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-01-31 14:41:31,629 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:41:31,630 WARN L398 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-31 14:41:31,630 WARN L399 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-31 14:41:51,190 WARN L181 SmtUtils]: Spent 4.20 s on a formula simplification that was a NOOP. DAG size: 67 [2019-01-31 14:41:51,304 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-31 14:42:00,066 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 VALID [2019-01-31 14:42:10,081 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-31 14:42:20,098 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-31 14:42:30,135 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-31 14:42:30,142 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-31 14:42:30,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-01-31 14:42:30,144 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-31 14:42:30,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:43:18,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-31 14:43:18,153 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-31 14:43:18,154 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-31 14:43:18,177 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-31 14:43:18,332 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-31 14:43:18,430 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-31 14:43:18,432 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-31 14:43:18,432 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-31 14:43:18,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:43:18,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-01-31 14:43:18,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:43:18,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 14:43:18,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:43:18,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-31 14:43:51,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-31 14:43:51,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 14:43:51,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 14:43:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-31 14:43:51,588 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-01-31 14:46:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:46:34,821 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-31 14:46:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 14:46:34,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 14:46:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:46:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 14:46:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-31 14:46:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 14:46:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-31 14:46:34,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2019-01-31 14:47:05,487 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-31 14:47:05,488 INFO L225 Difference]: With dead ends: 15 [2019-01-31 14:47:05,488 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 14:47:05,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-31 14:47:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 14:47:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 14:47:05,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:47:05,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-31 14:47:05,552 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-31 14:47:05,552 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-31 14:47:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:47:05,553 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 14:47:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 14:47:05,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:47:05,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:47:05,554 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-31 14:47:05,555 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-31 14:47:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:47:05,556 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 14:47:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 14:47:05,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:47:05,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:47:05,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:47:05,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:47:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 14:47:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-31 14:47:05,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-31 14:47:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:47:05,561 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-31 14:47:05,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 14:47:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 14:47:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 14:47:05,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:47:05,562 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-31 14:47:05,562 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:47:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:47:05,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-01-31 14:47:05,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:47:05,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:47:05,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:47:05,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:47:05,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:47:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:47:06,341 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-01-31 14:47:06,575 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-01-31 14:47:06,851 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-31 14:47:06,859 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-31 14:47:06,860 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-31 14:47:06,862 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-31 14:47:06,864 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-31 14:47:06,866 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-31 14:47:06,867 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-31 14:47:06,868 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-31 14:47:06,871 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-31 14:47:06,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2019-01-31 14:47:06,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-31 14:47:06,874 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-31 14:47:06,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:47:06,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:47:06,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:47:06,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:47:06,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:47:06,875 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-31 14:47:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:47:06,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:47:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:47:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:47:09,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:47:09,515 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-31 14:47:09,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,527 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-31 14:47:09,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-31 14:47:09,552 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:47:09,552 WARN L398 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-31 14:47:09,552 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-31 14:47:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,645 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-31 14:47:09,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,659 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-31 14:47:09,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,697 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-31 14:47:09,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:09,718 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-31 14:47:09,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:09,811 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-31 14:47:09,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-31 14:47:20,060 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:47:20,061 WARN L398 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-31 14:47:20,061 WARN L399 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-31 14:47:20,442 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-31 14:47:20,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,457 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-31 14:47:20,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,478 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-31 14:47:20,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:20,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:20,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,668 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 14:47:20,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,677 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-31 14:47:20,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:20,736 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-31 14:47:20,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:20,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:20,884 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-31 14:47:20,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-31 14:47:30,909 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:47:30,909 WARN L398 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-31 14:47:30,909 WARN L399 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-31 14:47:32,241 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-31 14:47:32,262 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 14:47:32,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,324 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 14:47:32,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,359 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-31 14:47:32,360 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-31 14:47:32,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,435 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-31 14:47:32,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:32,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:32,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,973 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-31 14:47:32,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:33,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:33,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:33,036 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-31 14:47:33,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:33,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:33,241 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-31 14:47:33,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-01-31 14:47:43,281 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:47:43,281 WARN L398 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-31 14:47:43,281 WARN L399 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-31 14:47:44,430 WARN L181 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-31 14:47:47,107 WARN L181 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-31 14:47:47,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,141 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-31 14:47:47,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:47,213 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-31 14:47:47,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:47,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:48,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,945 INFO L303 Elim1Store]: Index analysis took 294 ms [2019-01-31 14:47:48,946 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-31 14:47:48,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:49,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:49,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:49,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:47:49,013 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-31 14:47:49,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:47:49,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:47:49,798 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-31 14:47:49,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-01-31 14:47:59,808 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:47:59,809 WARN L398 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-31 14:47:59,809 WARN L399 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-31 14:48:05,179 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-31 14:48:12,651 WARN L181 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-31 14:48:12,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:12,862 INFO L303 Elim1Store]: Index analysis took 197 ms [2019-01-31 14:48:12,864 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-31 14:48:13,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:13,112 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-31 14:48:13,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:48:13,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:48:19,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:19,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:19,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:19,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:19,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:20,966 INFO L303 Elim1Store]: Index analysis took 2433 ms [2019-01-31 14:48:20,967 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-31 14:48:21,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:48:21,133 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-31 14:48:21,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:48:23,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:48:25,009 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-31 14:48:25,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-01-31 14:48:35,078 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:48:35,078 WARN L398 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-31 14:48:35,079 WARN L399 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-31 14:49:22,311 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 72 [2019-01-31 14:49:52,543 WARN L181 SmtUtils]: Spent 30.14 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-01-31 14:49:52,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:52,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:53,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:54,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,386 INFO L303 Elim1Store]: Index analysis took 2827 ms [2019-01-31 14:49:55,387 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-31 14:49:55,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:49:55,849 INFO L303 Elim1Store]: Index analysis took 403 ms [2019-01-31 14:49:55,851 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-31 14:49:55,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 14:49:58,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:50:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,355 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-31 14:50:26,356 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-31 14:50:26,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:50:26,489 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-31 14:50:26,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 14:50:26,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:50:28,501 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-31 14:50:28,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2019-01-31 14:50:38,624 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:50:38,625 WARN L398 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-31 14:50:38,625 WARN L399 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)))))))))))