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-1377b90 [2019-01-07 14:14:04,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:14:04,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:14:04,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:14:04,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:14:04,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:14:04,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:14:04,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:14:04,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:14:04,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:14:04,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:14:04,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:14:04,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:14:04,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:14:04,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:14:04,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:14:04,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:14:04,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:14:04,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:14:04,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:14:04,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:14:04,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:14:04,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:14:04,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:14:04,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:14:04,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:14:04,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:14:04,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:14:04,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:14:04,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:14:04,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:14:04,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:14:04,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:14:04,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:14:04,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:14:04,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:14:04,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 14:14:04,290 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:14:04,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:14:04,291 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:14:04,292 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:14:04,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:14:04,292 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:14:04,292 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:14:04,293 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:14:04,293 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 14:14:04,293 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:14:04,293 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 14:14:04,293 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 14:14:04,294 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:14:04,294 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:14:04,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:14:04,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:14:04,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:14:04,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:14:04,295 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:14:04,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:14:04,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:14:04,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:14:04,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:14:04,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:14:04,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:14:04,297 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:14:04,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:14:04,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:14:04,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:14:04,297 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:14:04,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:14:04,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:14:04,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:14:04,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:14:04,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:14:04,299 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:14:04,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:14:04,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:14:04,299 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:14:04,299 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:14:04,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:14:04,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:14:04,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:14:04,363 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:14:04,365 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:14:04,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl [2019-01-07 14:14:04,366 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/SkatingStrawberry.bpl' [2019-01-07 14:14:04,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:14:04,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:14:04,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:14:04,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:14:04,411 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:14:04,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,446 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 14:14:04,447 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 14:14:04,447 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 14:14:04,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:14:04,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:14:04,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:14:04,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:14:04,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... [2019-01-07 14:14:04,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:14:04,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:14:04,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:14:04,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:14:04,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:14:04,549 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-07 14:14:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 14:14:04,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 14:14:04,891 INFO L278 CfgBuilder]: Using library mode [2019-01-07 14:14:04,891 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-07 14:14:04,892 INFO L202 PluginConnector]: Adding new model SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:14:04 BoogieIcfgContainer [2019-01-07 14:14:04,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:14:04,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:14:04,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:14:04,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:14:04,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:14:04" (1/2) ... [2019-01-07 14:14:04,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523f4789 and model type SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:14:04, skipping insertion in model container [2019-01-07 14:14:04,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SkatingStrawberry.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:14:04" (2/2) ... [2019-01-07 14:14:04,900 INFO L112 eAbstractionObserver]: Analyzing ICFG SkatingStrawberry.bpl [2019-01-07 14:14:04,909 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:14:04,916 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:14:04,935 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:14:04,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:14:04,966 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:14:04,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:14:04,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:14:04,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:14:04,967 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:14:04,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:14:04,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:14:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 14:14:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:14:04,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:14:04,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:14:04,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:14:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:14:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-01-07 14:14:05,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:14:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:05,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:14:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:05,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:14:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:05,439 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-01-07 14:14:05,501 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} is VALID [2019-01-07 14:14:05,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (= 1000 (select main_a main_x)) (= (select main_a main_y) 0))} assume a[x] == 0; {12#(= (select main_a main_y) 1000)} is VALID [2019-01-07 14:14:05,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {10#false} is VALID [2019-01-07 14:14:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:05,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:14:05,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:14:05,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:14:05,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 14:14:05,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:14:05,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:14:05,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:14:05,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:14:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:14:05,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:14:05,569 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-07 14:14:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:05,870 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-07 14:14:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:14:05,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 14:14:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:14:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:14:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-07 14:14:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:14:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-07 14:14:05,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-01-07 14:14:05,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:14:05,966 INFO L225 Difference]: With dead ends: 15 [2019-01-07 14:14:05,966 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 14:14:05,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:14:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 14:14:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 14:14:06,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:14:06,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 14:14:06,066 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:14:06,067 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:14:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:06,069 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:14:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:14:06,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:14:06,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:14:06,071 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:14:06,071 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:14:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:06,074 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:14:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:14:06,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:14:06,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:14:06,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:14:06,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:14:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:14:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 14:14:06,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 14:14:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:14:06,081 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 14:14:06,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:14:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:14:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:14:06,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:14:06,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:14:06,084 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:14:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:14:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-01-07 14:14:06,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:14:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:14:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:06,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:14:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:06,416 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-07 14:14:06,452 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} is VALID [2019-01-07 14:14:06,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (+ main_x 1) main_y) (= (select main_a main_x) 1000) (or (< (div (+ main_y 1) 256) (+ (div (+ main_x 1) 256) 1)) (<= main_y (+ main_x 1))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {52#(= (select main_a main_x) 1000)} is VALID [2019-01-07 14:14:06,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(= (select main_a main_x) 1000)} assume a[x] == 0; {50#false} is VALID [2019-01-07 14:14:06,455 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-07 14:14:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:06,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:14:06,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:14:06,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 14:14:06,460 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-01-07 14:14:06,499 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:14:06,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:14:06,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:14:06,667 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 22 root evaluator evaluations with a maximum evaluation depth of 3. Performed 22 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 14:14:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:14:06,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:14:06,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:14:06,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 14:14:06,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:14:06,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:14:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:06,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:14:06,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-07 14:14:06,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:06,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:06,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-07 14:14:06,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:06,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:07,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:07,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 14:14:07,021 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:14:07,022 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_11]. (and (= main_a (store (store v_main_a_11 main_x 1000) main_y 0)) (= main_y (+ main_x 1))) [2019-01-07 14:14:07,022 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 14:14:07,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,468 INFO L303 Elim1Store]: Index analysis took 141 ms [2019-01-07 14:14:07,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2019-01-07 14:14:07,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,875 INFO L303 Elim1Store]: Index analysis took 213 ms [2019-01-07 14:14:07,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 70 [2019-01-07 14:14:07,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:07,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 90 [2019-01-07 14:14:08,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:08,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 14:14:08,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 57 [2019-01-07 14:14:08,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2019-01-07 14:14:08,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:08,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:08,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2019-01-07 14:14:08,318 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:08,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 14:14:08,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-07 14:14:08,563 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:145 [2019-01-07 14:14:10,771 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:14:10,772 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_12, main_xold, main_yold]. (let ((.cse0 (+ main_xold 1)) (.cse2 (select v_main_a_12 main_xold))) (and (= (select v_main_a_12 .cse0) 0) (= main_x (mod .cse0 256)) (= (let ((.cse1 (store v_main_a_12 main_x .cse2))) (store .cse1 (mod (+ main_xold 2) 256) (select .cse1 main_yold))) main_a) (= .cse2 1000))) [2019-01-07 14:14:10,772 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_4, v_prenex_3]. (let ((.cse6 (select main_a main_x)) (.cse1 (select main_a (+ main_x (- 1))))) (let ((.cse2 (= main_x (mod main_x 256))) (.cse3 (= 1000 .cse1)) (.cse0 (select main_a (mod (+ main_x 1) 256))) (.cse4 (= .cse6 .cse1))) (or (and (= .cse0 .cse1) .cse2 .cse3 .cse4) (let ((.cse5 (select main_a v_prenex_4)) (.cse7 (+ v_prenex_4 1))) (and (= (select main_a (mod (+ v_prenex_4 2) 256)) .cse5) (= .cse6 .cse5) (= .cse5 1000) (= 0 (select main_a .cse7)) (= main_x (mod .cse7 256)))) (and .cse2 .cse3 (= .cse0 (select main_a v_prenex_3)) .cse4) (let ((.cse8 (select main_a main_xold)) (.cse9 (+ main_xold 1))) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= .cse6 .cse8) (= 0 (select main_a .cse9)) (= .cse8 1000) (= main_x (mod .cse9 256))))))) [2019-01-07 14:14:11,039 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-01-07 14:14:11,204 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-07 14:14:13,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-01-07 14:14:13,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(or (exists ((main_xold Int) (main_yold Int)) (and (= (select main_a (mod (+ main_xold 2) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)))) (and (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} assume a[x] == 0; {50#false} is VALID [2019-01-07 14:14:13,251 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-07 14:14:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:13,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:14:13,321 INFO L273 TraceCheckUtils]: 3: Hoare triple {50#false} assume !(a[y] == 1000); {50#false} is VALID [2019-01-07 14:14:13,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#(not (= (select main_a main_x) 0))} assume a[x] == 0; {50#false} is VALID [2019-01-07 14:14:13,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {70#(not (= (select main_a main_x) 0))} is VALID [2019-01-07 14:14:13,326 INFO L273 TraceCheckUtils]: 0: Hoare triple {49#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {74#(forall ((v_main_yold_2 Int)) (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_2)) (mod (+ main_x 1) 256)))))} is VALID [2019-01-07 14:14:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:13,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:14:13,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-07 14:14:13,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:14:13,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 14:14:13,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:14:13,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 14:14:15,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-07 14:14:15,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 14:14:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 14:14:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 14:14:15,401 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-07 14:14:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:19,674 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 14:14:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:14:19,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 14:14:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:14:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:14:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-07 14:14:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:14:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-07 14:14:19,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-01-07 14:14:21,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 7 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-07 14:14:21,707 INFO L225 Difference]: With dead ends: 8 [2019-01-07 14:14:21,707 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 14:14:21,708 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-07 14:14:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 14:14:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 14:14:21,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:14:21,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-07 14:14:21,717 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 14:14:21,717 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 14:14:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:21,719 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 14:14:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 14:14:21,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:14:21,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:14:21,719 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 14:14:21,720 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 14:14:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:21,721 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 14:14:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 14:14:21,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:14:21,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:14:21,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:14:21,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:14:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:14:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-07 14:14:21,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-07 14:14:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:14:21,723 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-07 14:14:21,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 14:14:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 14:14:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 14:14:21,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:14:21,724 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 14:14:21,724 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:14:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:14:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-01-07 14:14:21,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:14:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:21,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:14:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:21,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:14:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:22,138 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-01-07 14:14:22,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} is VALID [2019-01-07 14:14:22,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= 1000 (select main_a main_x)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {113#(= 1000 (select main_a main_x))} is VALID [2019-01-07 14:14:22,145 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(= 1000 (select main_a main_x))} assume a[x] == 0; {110#false} is VALID [2019-01-07 14:14:22,145 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-07 14:14:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:22,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:14:22,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:14:22,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:14:22,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:14:22,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:14:22,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 14:14:22,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:14:22,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:14:22,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:14:22,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:14:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:22,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:14:22,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-07 14:14:22,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-07 14:14:22,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 14:14:22,222 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:14:22,222 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_14]. (and (= (store (store v_main_a_14 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2019-01-07 14:14:22,222 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 14:14:22,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 53 [2019-01-07 14:14:22,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 66 [2019-01-07 14:14:22,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-07 14:14:22,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 14:14:22,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 54 [2019-01-07 14:14:22,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 70 [2019-01-07 14:14:22,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:22,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 46 [2019-01-07 14:14:22,804 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:22,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-07 14:14:22,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-07 14:14:22,965 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:45, output treesize:157 [2019-01-07 14:14:25,142 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:14:25,143 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_15, main_xold, main_yold]. (let ((.cse0 (select v_main_a_15 main_xold)) (.cse2 (+ main_xold 1))) (and (= 1000 .cse0) (= (let ((.cse1 (store v_main_a_15 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a) (= (select v_main_a_15 .cse2) 0) (= main_x (mod .cse2 256)) (= main_y (mod (+ main_xold 2) 256)))) [2019-01-07 14:14:25,143 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, main_yold, v_prenex_8, v_prenex_7]. (let ((.cse0 (select main_a main_x)) (.cse10 (select main_a (+ main_x (- 1))))) (let ((.cse6 (= main_y (mod (+ main_x 1) 256))) (.cse3 (select main_a main_y)) (.cse7 (= main_x (mod main_x 256))) (.cse8 (= 1000 .cse10)) (.cse9 (= .cse0 .cse10))) (or (let ((.cse1 (select main_a v_prenex_8)) (.cse2 (+ v_prenex_8 1))) (and (= .cse0 .cse1) (= 0 (select main_a .cse2)) (= .cse1 1000) (= .cse3 .cse1) (= main_x (mod .cse2 256)) (= main_y (mod (+ v_prenex_8 2) 256)))) (let ((.cse4 (select main_a main_xold)) (.cse5 (+ main_xold 1))) (and (= .cse0 .cse4) (= .cse4 1000) (= 0 (select main_a .cse5)) (= main_x (mod .cse5 256)) (= .cse3 (select main_a main_yold)) (= main_y (mod (+ main_xold 2) 256)))) (and .cse6 .cse7 (= .cse3 (select main_a v_prenex_7)) .cse8 .cse9) (and .cse6 (= .cse3 .cse10) .cse7 .cse8 .cse9)))) [2019-01-07 14:14:25,412 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-01-07 14:14:25,687 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-07 14:14:25,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 72 [2019-01-07 14:14:25,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 100 [2019-01-07 14:14:25,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:25,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:25,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2019-01-07 14:14:25,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:25,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 93 [2019-01-07 14:14:25,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:25,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:26,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 122 [2019-01-07 14:14:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 167 [2019-01-07 14:14:26,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:26,403 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:26,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 125 [2019-01-07 14:14:26,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:26,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 164 [2019-01-07 14:14:26,484 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:26,537 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:26,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-07 14:14:26,649 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:125, output treesize:178 [2019-01-07 14:14:28,855 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:14:28,856 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_16, main_xold, main_yold, v_prenex_9, v_subst_1]. (or (let ((.cse1 (select v_main_a_16 (+ main_xold (- 1)))) (.cse2 (mod (+ main_xold 1) 256)) (.cse0 (select v_main_a_16 main_xold))) (and (= .cse0 .cse1) (= main_xold (mod main_xold 256)) (= 1000 .cse1) (= main_x .cse2) (= (let ((.cse3 (store v_main_a_16 main_x .cse0))) (store .cse3 (mod (+ .cse2 1) 256) (select .cse3 main_yold))) main_a))) (let ((.cse8 (+ v_subst_1 1))) (let ((.cse7 (mod .cse8 256))) (let ((.cse5 (select v_prenex_9 .cse7)) (.cse4 (select v_prenex_9 v_subst_1))) (and (= .cse4 .cse5) (= (let ((.cse6 (store v_prenex_9 main_x .cse5))) (store .cse6 (mod (+ (mod (+ v_subst_1 2) 256) 1) 256) (select .cse6 main_yold))) main_a) (= .cse4 1000) (= main_x (mod (+ .cse7 1) 256)) (= 0 (select v_prenex_9 .cse8))))))) [2019-01-07 14:14:28,856 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1, main_yold, v_prenex_11, main_xold, v_prenex_10]. (let ((.cse4 (select main_a main_x))) (or (let ((.cse3 (+ v_subst_1 1))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (select main_a v_subst_1)) (.cse2 (select main_a .cse0))) (and (= main_x (mod (+ .cse0 1) 256)) (= .cse1 .cse2) (= (select main_a .cse3) 0) (= .cse1 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= .cse4 .cse2))))) (let ((.cse8 (+ v_prenex_11 1))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (select main_a v_prenex_11)) (.cse5 (select main_a .cse6))) (and (= .cse5 (select main_a (mod (+ (mod (+ v_prenex_11 2) 256) 1) 256))) (= main_x (mod (+ .cse6 1) 256)) (= .cse7 .cse5) (= .cse7 1000) (= (select main_a .cse8) 0) (= .cse4 .cse5))))) (let ((.cse9 (select main_a main_xold)) (.cse11 (mod (+ main_xold 1) 256)) (.cse10 (select main_a (+ main_xold (- 1))))) (and (= main_xold (mod main_xold 256)) (= .cse9 .cse10) (= .cse4 .cse9) (= main_x .cse11) (= (select main_a (mod (+ .cse11 1) 256)) (select main_a v_prenex_10)) (= 1000 .cse10))))) [2019-01-07 14:14:29,118 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-07 14:14:29,143 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-07 14:14:31,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {117#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is UNKNOWN [2019-01-07 14:14:33,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(or (exists ((main_xold Int)) (and (= (select main_a main_x) (select main_a main_xold)) (= 0 (select main_a (+ main_xold 1))) (= (select main_a main_xold) 1000) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ main_xold 2) 256)))) (and (= main_y (mod (+ main_x 1) 256)) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} is UNKNOWN [2019-01-07 14:14:33,289 INFO L273 TraceCheckUtils]: 3: Hoare triple {125#(or (exists ((main_yold Int) (v_subst_1 Int)) (and (= main_x (mod (+ (mod (+ v_subst_1 1) 256) 1) 256)) (= (select main_a v_subst_1) (select main_a (mod (+ v_subst_1 1) 256))) (= (select main_a (+ v_subst_1 1)) 0) (= (select main_a v_subst_1) 1000) (= (select main_a (mod (+ (mod (+ v_subst_1 2) 256) 1) 256)) (select main_a main_yold)) (= (select main_a main_x) (select main_a (mod (+ v_subst_1 1) 256))))) (exists ((main_xold Int) (v_prenex_10 Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (select main_a v_prenex_10)) (= main_x (mod (+ main_xold 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))))))} assume a[x] == 0; {110#false} is VALID [2019-01-07 14:14:33,290 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-07 14:14:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:33,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:14:35,472 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#false} assume !(a[y] == 1000); {110#false} is VALID [2019-01-07 14:14:35,482 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(not (= (select main_a main_x) 0))} assume a[x] == 0; {110#false} is VALID [2019-01-07 14:14:35,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {135#(not (= (select main_a main_x) 0))} is VALID [2019-01-07 14:14:35,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2019-01-07 14:14:35,490 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {139#(forall ((v_main_yold_3 Int)) (not (= (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) v_main_yold_3)) (mod (+ main_x 1) 256)) 0)))} is VALID [2019-01-07 14:14:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 14:14:35,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:14:35,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-07 14:14:35,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:14:35,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 14:14:35,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:14:35,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-07 14:14:39,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 7 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-07 14:14:39,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 14:14:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 14:14:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 14:14:39,613 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-01-07 14:14:48,842 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-01-07 14:14:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:53,046 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-07 14:14:53,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 14:14:53,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 14:14:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:14:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:14:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-07 14:14:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:14:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-07 14:14:53,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-01-07 14:14:57,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-01-07 14:14:57,175 INFO L225 Difference]: With dead ends: 10 [2019-01-07 14:14:57,175 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 14:14:57,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 14:14:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 14:14:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 14:14:57,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:14:57,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-07 14:14:57,239 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 14:14:57,239 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 14:14:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:57,241 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 14:14:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 14:14:57,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:14:57,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:14:57,242 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 14:14:57,242 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 14:14:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:14:57,243 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 14:14:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 14:14:57,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:14:57,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:14:57,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:14:57,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:14:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:14:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-07 14:14:57,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-07 14:14:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:14:57,245 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-07 14:14:57,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 14:14:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 14:14:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 14:14:57,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:14:57,245 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-07 14:14:57,246 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:14:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:14:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 3 times [2019-01-07 14:14:57,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:14:57,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:57,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:14:57,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:14:57,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:14:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:57,878 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-01-07 14:14:57,979 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} is VALID [2019-01-07 14:14:57,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#(and (= 1000 (select main_a main_x)) (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} is VALID [2019-01-07 14:14:57,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (= 1000 (select main_a main_x)) (<= main_x (+ main_y 255)) (or (and (<= main_x 254) (<= main_y (+ main_x 1))) (<= main_y 0)) (or (<= (+ main_y (* 256 (div (+ main_x 1) 256)) 255) (+ (* 256 (div (+ main_y 1) 256)) main_x)) (<= (+ (* 256 (div (+ main_y 1) 256)) main_x 1) (+ main_y (* 256 (div (+ main_x 1) 256))))) (< 0 (+ main_y 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} is VALID [2019-01-07 14:14:57,991 INFO L273 TraceCheckUtils]: 3: Hoare triple {195#(and (= 1000 (select main_a main_x)) (not (= main_x main_y)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} is VALID [2019-01-07 14:14:57,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {196#(and (= 1000 (select main_a main_x)) (= 1000 (select main_a main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {197#(= (select main_a main_y) 1000)} is VALID [2019-01-07 14:14:57,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#(= (select main_a main_y) 1000)} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2019-01-07 14:14:57,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-07 14:14:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:14:57,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:14:57,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:14:57,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:14:57,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:14:57,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:14:57,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 14:14:58,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 14:14:58,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 14:14:58,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 14:14:58,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:14:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:14:58,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:14:58,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-07 14:14:58,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-07 14:14:58,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 14:14:58,332 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:14:58,333 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_19]. (and (= main_y (+ main_x 1)) (= (store (store v_main_a_19 main_x 1000) main_y 0) main_a)) [2019-01-07 14:14:58,333 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 14:14:58,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-07 14:14:58,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-07 14:14:58,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-07 14:14:58,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:14:58,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-07 14:14:58,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:14:58,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-07 14:14:58,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-07 14:15:00,896 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:15:00,896 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_20, main_yold]. (let ((.cse1 (select v_main_a_20 (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= (select v_main_a_20 main_yold) 0) (= (let ((.cse0 (store v_main_a_20 main_x .cse1))) (store .cse0 main_y (select .cse0 main_yold))) main_a) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 1000))) [2019-01-07 14:15:00,897 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2019-01-07 14:15:01,256 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-07 14:15:01,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-07 14:15:01,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-07 14:15:01,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:01,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:01,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,532 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:15:01,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 148 [2019-01-07 14:15:01,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:01,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 136 [2019-01-07 14:15:01,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:01,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:01,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:15:01,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-07 14:15:03,797 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:15:03,797 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_21, v_subst_2, v_prenex_12, main_xold]. (or (let ((.cse5 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_21 v_subst_2)) (.cse4 (select v_main_a_21 (+ v_subst_2 (- 1)))) (.cse3 (select v_main_a_21 .cse5)) (.cse1 (mod (+ v_subst_2 1) 256))) (and (= 0 .cse0) (= (select v_main_a_21 .cse1) .cse0) (= main_a (let ((.cse2 (store v_main_a_21 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1)))) (= 1000 .cse4) (= .cse4 .cse3) (= main_x (mod (+ .cse5 1) 256)) (= (mod (+ .cse1 1) 256) main_y)))) (let ((.cse8 (select v_prenex_12 main_xold)) (.cse9 (select v_prenex_12 (+ main_xold (- 1)))) (.cse7 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= (let ((.cse6 (store v_prenex_12 main_x .cse8))) (store .cse6 main_y (select .cse6 .cse7))) main_a) (= .cse8 .cse9) (= .cse9 1000) (= main_x .cse7) (= .cse9 (select v_prenex_12 .cse7)) (= main_y (mod (+ .cse7 1) 256))))) [2019-01-07 14:15:03,797 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, main_xold]. (or (let ((.cse3 (mod v_subst_2 256))) (let ((.cse2 (mod (+ v_subst_2 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a .cse3))) (and (= .cse0 1000) (= (select main_a main_y) .cse1) (= 0 (select main_a v_subst_2)) (= (mod (+ .cse2 1) 256) main_y) (= main_x .cse2) (= .cse0 .cse1) (= (select main_a (mod (+ .cse3 1) 256)) .cse1)))) (let ((.cse6 (mod (+ main_xold 1) 256))) (let ((.cse5 (select main_a (+ main_xold (- 1)))) (.cse4 (select main_a main_xold)) (.cse7 (mod (+ .cse6 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse4 .cse5) (= (select main_a main_x) .cse4) (= main_x .cse6) (= main_y .cse7) (= 1000 .cse5) (= .cse4 (select main_a .cse7)))))) [2019-01-07 14:15:04,486 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-07 14:15:04,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 161 [2019-01-07 14:15:04,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 159 [2019-01-07 14:15:04,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:04,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,881 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:15:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:04,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 270 [2019-01-07 14:15:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:05,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 192 [2019-01-07 14:15:05,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:05,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:05,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:15:05,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:177 [2019-01-07 14:15:07,418 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:15:07,418 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_22, v_subst_2, v_prenex_13, v_subst_3]. (or (let ((.cse4 (mod v_subst_2 256)) (.cse2 (mod (+ v_subst_2 1) 256))) (let ((.cse1 (mod (+ .cse2 1) 256)) (.cse3 (select v_main_a_22 (+ v_subst_2 (- 1)))) (.cse5 (select v_main_a_22 .cse4))) (and (= (let ((.cse0 (store v_main_a_22 main_x (select v_main_a_22 .cse2)))) (store .cse0 main_y (select .cse0 .cse1))) main_a) (= (select v_main_a_22 v_subst_2) 0) (= 1000 .cse3) (= (mod (+ .cse1 1) 256) main_y) (= (select v_main_a_22 (mod (+ .cse4 1) 256)) .cse5) (= .cse1 main_x) (= (select v_main_a_22 .cse1) .cse5) (= .cse3 .cse5)))) (let ((.cse11 (mod (+ v_subst_3 1) 256))) (let ((.cse7 (select v_prenex_13 (+ v_subst_3 (- 1)))) (.cse9 (select v_prenex_13 .cse11)) (.cse10 (select v_prenex_13 v_subst_3)) (.cse6 (mod (+ .cse11 1) 256))) (and (= .cse6 main_x) (= .cse7 1000) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse8 (store v_prenex_13 main_x .cse9))) (store .cse8 main_y (select .cse8 .cse6))) main_a) (= .cse7 .cse10) (= .cse10 .cse9) (= (select v_prenex_13 .cse6) .cse10) (= main_y (mod (+ .cse6 1) 256)))))) [2019-01-07 14:15:07,419 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_3, v_subst_2]. (let ((.cse3 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_3 1) 256))) (let ((.cse0 (mod (+ .cse4 1) 256)) (.cse2 (select main_a .cse4)) (.cse1 (select main_a v_subst_3))) (and (= .cse0 main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= .cse1 .cse2) (= main_y (mod (+ .cse0 1) 256)) (= .cse3 .cse2) (= (select main_a .cse0) .cse2) (= .cse1 1000)))) (let ((.cse9 (mod v_subst_2 256))) (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse5 (select main_a (+ v_subst_2 (- 1)))) (.cse7 (select main_a (mod (+ .cse9 1) 256))) (.cse8 (select main_a .cse9))) (and (= .cse5 1000) (= (mod (+ .cse6 1) 256) main_y) (= .cse7 .cse3) (= .cse6 main_x) (= .cse7 (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= .cse5 .cse8) (= .cse7 .cse8)))))) [2019-01-07 14:15:07,966 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-07 14:15:13,891 WARN L181 SmtUtils]: Spent 5.84 s on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-01-07 14:15:13,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:13,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 296 [2019-01-07 14:15:14,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:14,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:14,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:14,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:14,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:14,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:14,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 212 [2019-01-07 14:15:14,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:14,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:16,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,459 INFO L303 Elim1Store]: Index analysis took 346 ms [2019-01-07 14:15:16,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 394 [2019-01-07 14:15:16,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:16,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 319 [2019-01-07 14:15:16,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:17,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:17,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:15:17,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:317, output treesize:249 [2019-01-07 14:15:19,460 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:15:19,460 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_23, v_subst_2, v_prenex_14, v_subst_3]. (or (let ((.cse6 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256)) (.cse7 (mod v_subst_2 256))) (let ((.cse0 (select v_main_a_23 .cse7)) (.cse2 (select v_main_a_23 (mod (+ .cse7 1) 256))) (.cse3 (mod (+ .cse6 1) 256)) (.cse4 (select v_main_a_23 .cse6)) (.cse1 (select v_main_a_23 (+ v_subst_2 (- 1))))) (and (= .cse0 .cse1) (= .cse2 (select v_main_a_23 .cse3)) (= .cse4 .cse2) (= 0 (select v_main_a_23 v_subst_2)) (= .cse0 .cse2) (= .cse3 main_x) (= main_y (mod (+ .cse3 1) 256)) (= (let ((.cse5 (store v_main_a_23 main_x .cse4))) (store .cse5 main_y (select .cse5 .cse3))) main_a) (= .cse1 1000)))) (let ((.cse14 (mod (+ v_subst_3 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse10 (select v_prenex_14 v_subst_3)) (.cse8 (mod (+ .cse13 1) 256)) (.cse9 (select v_prenex_14 .cse14)) (.cse12 (select v_prenex_14 .cse13))) (and (= main_y (mod (+ .cse8 1) 256)) (= .cse9 .cse10) (= 1000 (select v_prenex_14 (+ v_subst_3 (- 1)))) (= v_subst_3 (mod v_subst_3 256)) (= (let ((.cse11 (store v_prenex_14 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse8))) main_a) (= main_x .cse8) (= 1000 .cse10) (= (select v_prenex_14 .cse8) .cse9) (= .cse9 .cse12)))))) [2019-01-07 14:15:19,460 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2, v_subst_3]. (let ((.cse5 (select main_a main_x))) (or (let ((.cse7 (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (let ((.cse6 (mod v_subst_2 256)) (.cse4 (mod (+ .cse7 1) 256))) (let ((.cse2 (mod (+ .cse4 1) 256)) (.cse0 (select main_a (+ v_subst_2 (- 1)))) (.cse1 (select main_a (mod (+ .cse6 1) 256))) (.cse3 (select main_a .cse7))) (and (= .cse0 1000) (= .cse1 1000) (= (select main_a .cse2) .cse3) (= .cse4 main_x) (= main_y .cse2) (= 0 (select main_a v_subst_2)) (= .cse5 .cse3) (= .cse0 (select main_a .cse6)) (= .cse1 .cse3))))) (let ((.cse13 (mod (+ v_subst_3 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse9 (select main_a .cse12)) (.cse11 (select main_a .cse13)) (.cse8 (mod (+ .cse12 1) 256)) (.cse10 (select main_a v_subst_3))) (and (= main_y (mod (+ .cse8 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= .cse9 .cse5) (= v_subst_3 (mod v_subst_3 256)) (= .cse9 (select main_a main_y)) (= .cse10 .cse11) (= .cse9 .cse11) (= main_x .cse8) (= .cse10 1000))))))) [2019-01-07 14:15:25,721 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-07 14:15:25,781 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {201#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-07 14:15:26,388 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-07 14:15:28,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2019-01-07 14:15:30,409 INFO L273 TraceCheckUtils]: 3: Hoare triple {209#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a main_y) (select main_a (mod v_subst_2 256))) (= 0 (select main_a v_subst_2)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_y) (= main_x (mod (+ v_subst_2 1) 256)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} is UNKNOWN [2019-01-07 14:15:32,421 INFO L273 TraceCheckUtils]: 4: Hoare triple {213#(or (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_y)) (= (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) main_x) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a main_x)) (= 0 (select main_a v_subst_2)) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod v_subst_2 256))))) (exists ((v_subst_3 Int)) (and (= (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) main_x) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} is UNKNOWN [2019-01-07 14:15:32,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(or (exists ((v_subst_3 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (+ v_subst_3 (- 1))) 1000) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_3 (mod v_subst_3 256)) (= (select main_a v_subst_3) (select main_a (mod (+ v_subst_3 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_3 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_3 1) 256) 1) 256)) (select main_a (mod (+ v_subst_3 1) 256))) (= (select main_a v_subst_3) 1000))) (exists ((v_subst_2 Int)) (and (= (select main_a (+ v_subst_2 (- 1))) 1000) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) 1000) (= (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) main_x) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_2 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= 0 (select main_a v_subst_2)) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (mod (+ (mod v_subst_2 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_2 1) 256) 1) 256))) (= (select main_a (+ v_subst_2 (- 1))) (select main_a (mod v_subst_2 256))))))} assume a[x] == 0; {192#false} is VALID [2019-01-07 14:15:32,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#false} assume !(a[y] == 1000); {192#false} is VALID [2019-01-07 14:15:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:15:32,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:15:43,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {192#false} is VALID [2019-01-07 14:15:43,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {197#(= (select main_a main_y) 1000)} is VALID [2019-01-07 14:15:43,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {227#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-01-07 14:15:43,712 INFO L273 TraceCheckUtils]: 3: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {231#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2019-01-07 14:15:43,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:15:44,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:15:44,374 INFO L273 TraceCheckUtils]: 0: Hoare triple {191#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {235#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:15:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 14:15:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:15:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 14 [2019-01-07 14:15:44,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:15:44,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 14:15:44,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:15:44,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-07 14:15:51,543 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-07 14:15:51,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 14:15:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 14:15:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2019-01-07 14:15:51,544 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 12 states. [2019-01-07 14:16:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:16:27,228 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-07 14:16:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 14:16:27,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 14:16:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:16:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 14:16:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-07 14:16:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 14:16:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-07 14:16:27,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2019-01-07 14:16:33,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 15 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-07 14:16:33,846 INFO L225 Difference]: With dead ends: 15 [2019-01-07 14:16:33,846 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 14:16:33,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2019-01-07 14:16:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 14:16:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 14:16:33,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:16:33,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-07 14:16:33,907 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 14:16:33,907 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 14:16:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:16:33,909 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 14:16:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 14:16:33,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:16:33,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:16:33,909 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 14:16:33,910 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 14:16:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:16:33,911 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 14:16:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 14:16:33,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:16:33,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:16:33,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:16:33,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:16:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 14:16:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-07 14:16:33,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-07 14:16:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:16:33,913 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-07 14:16:33,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 14:16:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 14:16:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 14:16:33,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:16:33,914 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-07 14:16:33,914 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:16:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:16:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 4 times [2019-01-07 14:16:33,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:16:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:16:33,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:16:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:16:33,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:16:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:16:34,877 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-01-07 14:16:35,153 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a main_y)) (<= main_y (+ main_x 1)))} is VALID [2019-01-07 14:16:35,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {315#(and (<= (+ main_x 1) main_y) (not (= 0 (select main_a main_x))) (= 0 (select main_a main_y)) (<= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} is VALID [2019-01-07 14:16:35,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {316#(and (< 0 (+ (div (+ main_x 1) 256) 1)) (<= main_x (+ main_y 255)) (or (< 0 (div (+ main_x 1) 256)) (and (<= (+ main_x 1) main_y) (<= main_y (+ main_x 1)))) (not (= 0 (select main_a main_x))) (<= (div (+ main_x 1) 256) 1) (or (<= (+ main_y 255) main_x) (and (<= (+ main_x 1) main_y) (<= main_y 255))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 14:16:35,162 INFO L273 TraceCheckUtils]: 3: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 14:16:35,163 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 14:16:35,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 14:16:35,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(and (= (select main_a main_x) (select main_a main_y)) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 14:16:35,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} is VALID [2019-01-07 14:16:35,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(and (not (= 0 (select main_a main_x))) (not (= 0 (select main_a main_y))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {319#(not (= 0 (select main_a main_x)))} is VALID [2019-01-07 14:16:35,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(not (= 0 (select main_a main_x)))} assume a[x] == 0; {314#false} is VALID [2019-01-07 14:16:35,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-07 14:16:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-07 14:16:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:16:35,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:16:35,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:16:35,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:16:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:16:35,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 14:16:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:16:35,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:16:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:16:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:16:38,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:16:38,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-07 14:16:38,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-07 14:16:38,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:16 [2019-01-07 14:16:38,376 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:16:38,376 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_28]. (and (= (store (store v_main_a_28 main_x 1000) main_y 0) main_a) (= main_y (+ main_x 1))) [2019-01-07 14:16:38,376 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1))) [2019-01-07 14:16:38,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2019-01-07 14:16:38,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-07 14:16:38,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-07 14:16:38,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:38,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-07 14:16:38,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:38,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-07 14:16:38,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:80 [2019-01-07 14:16:40,946 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:16:40,947 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_29, main_yold]. (let ((.cse0 (select v_main_a_29 (+ main_yold (- 1))))) (and (= 0 (select v_main_a_29 main_yold)) (= .cse0 1000) (= (mod main_yold 256) main_x) (= main_y (mod (+ main_yold 1) 256)) (= (let ((.cse1 (store v_main_a_29 main_x .cse0))) (store .cse1 main_y (select .cse1 main_yold))) main_a))) [2019-01-07 14:16:40,947 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_yold]. (let ((.cse1 (select main_a main_y)) (.cse2 (select main_a main_x))) (or (let ((.cse0 (select main_a main_yold)) (.cse3 (select main_a (+ main_yold (- 1))))) (and (= (mod main_yold 256) main_x) (= 0 .cse0) (= main_y (mod (+ main_yold 1) 256)) (= .cse1 .cse0) (= .cse2 .cse3) (= 1000 .cse3))) (let ((.cse4 (select main_a (+ main_x (- 1))))) (and (= main_y (mod (+ main_x 1) 256)) (= .cse1 .cse4) (= main_x (mod main_x 256)) (= 1000 .cse4) (= .cse2 .cse4))))) [2019-01-07 14:16:41,368 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-07 14:16:41,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2019-01-07 14:16:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2019-01-07 14:16:41,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:41,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:41,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,565 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:16:41,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 130 [2019-01-07 14:16:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:41,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 126 [2019-01-07 14:16:41,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:41,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:41,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:16:41,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:129 [2019-01-07 14:16:43,797 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:16:43,798 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_16, main_xold, v_main_a_30, v_subst_4]. (or (let ((.cse3 (select v_prenex_16 main_xold)) (.cse0 (select v_prenex_16 (+ main_xold (- 1)))) (.cse1 (mod (+ main_xold 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 (select v_prenex_16 .cse1)) (= main_x .cse1) (= 1000 .cse0) (= (let ((.cse2 (store v_prenex_16 main_x .cse3))) (store .cse2 main_y (select .cse2 .cse1))) main_a) (= .cse3 .cse0) (= main_y (mod (+ .cse1 1) 256)))) (let ((.cse9 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse4 (select v_main_a_30 v_subst_4)) (.cse8 (select v_main_a_30 .cse9)) (.cse6 (select v_main_a_30 (+ v_subst_4 (- 1))))) (and (= .cse4 (select v_main_a_30 .cse5)) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (let ((.cse7 (store v_main_a_30 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse5))) main_a) (= .cse4 0) (= main_x (mod (+ .cse9 1) 256)) (= .cse8 .cse6))))) [2019-01-07 14:16:43,798 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [main_xold, v_subst_4]. (or (let ((.cse2 (mod (+ main_xold 1) 256))) (let ((.cse1 (select main_a (+ main_xold (- 1)))) (.cse0 (select main_a main_xold)) (.cse3 (mod (+ .cse2 1) 256))) (and (= main_xold (mod main_xold 256)) (= .cse0 .cse1) (= (select main_a main_x) .cse0) (= main_x .cse2) (= main_y .cse3) (= 1000 .cse1) (= .cse0 (select main_a .cse3))))) (let ((.cse7 (mod v_subst_4 256))) (let ((.cse5 (mod (+ v_subst_4 1) 256)) (.cse6 (select main_a (+ v_subst_4 (- 1)))) (.cse4 (select main_a .cse7))) (and (= .cse4 (select main_a .cse5)) (= 0 (select main_a v_subst_4)) (= 1000 .cse6) (= main_y (mod (+ .cse5 1) 256)) (= .cse4 .cse6) (= .cse4 (select main_a main_y)) (= main_x (mod (+ .cse7 1) 256)))))) [2019-01-07 14:16:45,146 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-07 14:16:45,165 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:16:45,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,234 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:16:45,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 259 [2019-01-07 14:16:45,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 178 [2019-01-07 14:16:45,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:45,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:45,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 171 [2019-01-07 14:16:45,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:45,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 127 [2019-01-07 14:16:45,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:45,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:46,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:16:46,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:229, output treesize:173 [2019-01-07 14:16:48,176 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:16:48,177 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_17, v_subst_4, v_main_a_31, v_subst_5]. (or (let ((.cse6 (mod v_subst_4 256)) (.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse0 (mod (+ .cse5 1) 256)) (.cse4 (select v_prenex_17 (+ v_subst_4 (- 1)))) (.cse1 (select v_prenex_17 .cse6)) (.cse3 (mod (+ .cse6 1) 256))) (and (= (select v_prenex_17 .cse0) .cse1) (= (let ((.cse2 (store v_prenex_17 main_x (select v_prenex_17 .cse3)))) (store .cse2 main_y (select .cse2 .cse0))) main_a) (= .cse4 1000) (= (select v_prenex_17 .cse5) .cse1) (= (select v_prenex_17 v_subst_4) 0) (= main_y (mod (+ .cse0 1) 256)) (= .cse4 .cse1) (= main_x (mod (+ .cse3 1) 256))))) (let ((.cse12 (mod (+ v_subst_5 1) 256))) (let ((.cse11 (select v_main_a_31 (+ v_subst_5 (- 1)))) (.cse7 (select v_main_a_31 v_subst_5)) (.cse10 (select v_main_a_31 .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= .cse7 (select v_main_a_31 .cse8)) (= (let ((.cse9 (store v_main_a_31 main_x .cse10))) (store .cse9 main_y (select .cse9 .cse8))) main_a) (= .cse7 .cse11) (= 1000 .cse11) (= .cse7 .cse10) (= main_y (mod (+ .cse8 1) 256)) (= main_x .cse8) (= v_subst_5 (mod v_subst_5 256)))))) [2019-01-07 14:16:48,177 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse2 (select main_a main_y))) (or (let ((.cse4 (mod (+ v_subst_5 1) 256))) (let ((.cse0 (select main_a .cse4)) (.cse3 (select main_a v_subst_5)) (.cse1 (mod (+ .cse4 1) 256))) (and (= .cse0 (select main_a .cse1)) (= .cse0 .cse2) (= .cse3 .cse0) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= .cse3 1000) (= main_y (mod (+ .cse1 1) 256)) (= main_x .cse1) (= v_subst_5 (mod v_subst_5 256))))) (let ((.cse9 (mod (+ v_subst_4 1) 256))) (let ((.cse5 (select main_a (mod v_subst_4 256))) (.cse7 (select main_a (+ v_subst_4 (- 1)))) (.cse8 (mod (+ .cse9 1) 256)) (.cse6 (select main_a .cse9))) (and (= .cse5 .cse6) (= 0 (select main_a v_subst_4)) (= 1000 .cse7) (= main_y (mod (+ .cse8 1) 256)) (= .cse5 .cse7) (= .cse6 .cse2) (= main_x .cse8) (= .cse6 (select main_a main_x))))))) [2019-01-07 14:16:48,536 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-07 14:16:51,714 WARN L181 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-07 14:16:51,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 298 [2019-01-07 14:16:51,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:51,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 214 [2019-01-07 14:16:51,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:51,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:52,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:52,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:52,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:52,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:52,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,197 INFO L303 Elim1Store]: Index analysis took 311 ms [2019-01-07 14:16:53,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 378 [2019-01-07 14:16:53,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:16:53,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 287 [2019-01-07 14:16:53,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:16:53,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:16:53,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:16:53,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:313, output treesize:235 [2019-01-07 14:16:56,007 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:16:56,008 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_18, v_subst_5, v_main_a_32, v_subst_4]. (or (let ((.cse6 (mod (+ v_subst_5 1) 256))) (let ((.cse5 (mod (+ .cse6 1) 256))) (let ((.cse0 (select v_prenex_18 v_subst_5)) (.cse3 (select v_prenex_18 .cse6)) (.cse2 (select v_prenex_18 .cse5)) (.cse1 (mod (+ .cse5 1) 256))) (and (= .cse0 1000) (= main_x .cse1) (= .cse0 (select v_prenex_18 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= .cse0 .cse3) (= .cse3 (select v_prenex_18 .cse1)) (= (let ((.cse4 (store v_prenex_18 main_x .cse2))) (store .cse4 main_y (select .cse4 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= main_y (mod (+ .cse1 1) 256)))))) (let ((.cse14 (mod (+ v_subst_4 1) 256))) (let ((.cse13 (mod (+ .cse14 1) 256))) (let ((.cse8 (select v_main_a_32 (+ v_subst_4 (- 1)))) (.cse10 (select v_main_a_32 (mod v_subst_4 256))) (.cse7 (mod (+ .cse13 1) 256)) (.cse9 (select v_main_a_32 .cse14)) (.cse12 (select v_main_a_32 .cse13))) (and (= (mod (+ .cse7 1) 256) main_y) (= (select v_main_a_32 v_subst_4) 0) (= 1000 .cse8) (= .cse9 .cse10) (= .cse8 .cse10) (= (select v_main_a_32 .cse7) .cse9) (= main_x .cse7) (= (let ((.cse11 (store v_main_a_32 main_x .cse12))) (store .cse11 main_y (select .cse11 .cse7))) main_a) (= .cse9 .cse12)))))) [2019-01-07 14:16:56,008 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse5 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse6 (mod (+ .cse7 1) 256))) (let ((.cse2 (select main_a v_subst_5)) (.cse1 (select main_a .cse6)) (.cse0 (select main_a .cse7)) (.cse3 (mod (+ .cse6 1) 256))) (and (= .cse0 .cse1) (= .cse2 .cse0) (= .cse2 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse3) (= .cse1 .cse4) (= .cse1 .cse5) (= v_subst_5 (mod v_subst_5 256)) (= .cse0 1000) (= main_y (mod (+ .cse3 1) 256)))))) (let ((.cse13 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse13 1) 256))) (let ((.cse11 (select main_a (+ v_subst_4 (- 1)))) (.cse9 (select main_a .cse13)) (.cse10 (select main_a .cse12)) (.cse8 (mod (+ .cse12 1) 256))) (and (= (mod (+ .cse8 1) 256) main_y) (= .cse9 .cse10) (= 0 (select main_a v_subst_4)) (= 1000 .cse11) (= .cse5 .cse10) (= (select main_a (mod v_subst_4 256)) .cse11) (= .cse9 1000) (= .cse4 .cse10) (= main_x .cse8))))))) [2019-01-07 14:17:04,259 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 64 [2019-01-07 14:17:10,726 WARN L181 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-07 14:17:10,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:10,917 INFO L303 Elim1Store]: Index analysis took 175 ms [2019-01-07 14:17:10,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 491 [2019-01-07 14:17:11,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:11,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 367 [2019-01-07 14:17:11,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:17:11,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:17:17,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:17,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:17,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:18,991 INFO L303 Elim1Store]: Index analysis took 1782 ms [2019-01-07 14:17:18,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 585 [2019-01-07 14:17:19,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:19,186 INFO L303 Elim1Store]: Index analysis took 125 ms [2019-01-07 14:17:19,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 450 [2019-01-07 14:17:19,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:17:20,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:17:21,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:17:21,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:423, output treesize:319 [2019-01-07 14:17:23,294 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:17:23,294 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_33, v_subst_4, v_prenex_19, v_subst_5]. (or (let ((.cse7 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse6 (mod (+ .cse8 1) 256))) (let ((.cse4 (select v_main_a_33 (+ v_subst_4 (- 1)))) (.cse2 (select v_main_a_33 .cse8)) (.cse1 (select v_main_a_33 .cse7)) (.cse0 (mod (+ .cse6 1) 256)) (.cse3 (select v_main_a_33 .cse6))) (and (= main_y (mod (+ .cse0 1) 256)) (= .cse1 1000) (= .cse2 (select v_main_a_33 .cse0)) (= (select v_main_a_33 v_subst_4) 0) (= .cse2 .cse3) (= (select v_main_a_33 (mod v_subst_4 256)) .cse4) (= .cse0 main_x) (= 1000 .cse4) (= .cse2 .cse1) (= (let ((.cse5 (store v_main_a_33 main_x .cse3))) (store .cse5 main_y (select .cse5 .cse0))) main_a)))))) (let ((.cse15 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse15 1) 256))) (let ((.cse16 (mod (+ .cse17 1) 256))) (let ((.cse10 (select v_prenex_19 .cse17)) (.cse12 (select v_prenex_19 .cse16)) (.cse9 (mod (+ .cse16 1) 256)) (.cse14 (select v_prenex_19 v_subst_5)) (.cse11 (select v_prenex_19 .cse15))) (and (= main_x .cse9) (= .cse10 .cse11) (= (select v_prenex_19 .cse9) .cse10) (= .cse12 .cse10) (= (let ((.cse13 (store v_prenex_19 main_x .cse12))) (store .cse13 main_y (select .cse13 .cse9))) main_a) (= main_y (mod (+ .cse9 1) 256)) (= .cse14 (select v_prenex_19 (+ v_subst_5 (- 1)))) (= 1000 .cse11) (= .cse14 .cse11) (= v_subst_5 (mod v_subst_5 256)))))))) [2019-01-07 14:17:23,295 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse6 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse3 (mod (+ v_subst_4 1) 256))) (let ((.cse8 (mod (+ .cse3 1) 256))) (let ((.cse7 (mod (+ .cse8 1) 256))) (let ((.cse1 (select main_a .cse8)) (.cse2 (select main_a .cse7)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse7 1) 256))) (and (= main_y (mod (+ .cse0 1) 256)) (= 1000 .cse1) (= .cse2 .cse1) (= (select main_a .cse3) .cse1) (= .cse2 .cse4) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= .cse2 .cse6) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse0 main_x)))))) (let ((.cse14 (mod (+ v_subst_5 1) 256))) (let ((.cse16 (mod (+ .cse14 1) 256))) (let ((.cse15 (mod (+ .cse16 1) 256))) (let ((.cse10 (select main_a v_subst_5)) (.cse9 (select main_a .cse15)) (.cse13 (select main_a .cse16)) (.cse12 (mod (+ .cse15 1) 256)) (.cse11 (select main_a .cse14))) (and (= .cse9 .cse6) (= .cse10 .cse11) (= main_x .cse12) (= .cse10 (select main_a (+ v_subst_5 (- 1)))) (= .cse13 1000) (= .cse9 .cse4) (= .cse9 .cse13) (= main_y (mod (+ .cse12 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= .cse11 1000)))))))) [2019-01-07 14:17:37,520 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 72 [2019-01-07 14:17:51,009 WARN L181 SmtUtils]: Spent 13.38 s on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-01-07 14:17:51,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:51,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:53,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,297 INFO L303 Elim1Store]: Index analysis took 3273 ms [2019-01-07 14:17:54,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 876 [2019-01-07 14:17:54,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:17:54,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 713 [2019-01-07 14:17:54,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:17:56,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:18:14,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:14,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:14,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:14,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:14,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:14,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:14,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,056 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-07 14:18:15,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 746 [2019-01-07 14:18:15,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:18:15,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 574 [2019-01-07 14:18:15,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:18:15,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:18:19,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:18:19,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:547, output treesize:445 [2019-01-07 14:18:22,016 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:18:22,017 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_20, v_subst_5, v_main_a_34, v_subst_4]. (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse9 (mod (+ .cse7 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse2 (select v_prenex_20 v_subst_5)) (.cse1 (mod (+ .cse10 1) 256)) (.cse5 (select v_prenex_20 .cse10)) (.cse4 (select v_prenex_20 .cse9)) (.cse0 (select v_prenex_20 .cse8)) (.cse3 (select v_prenex_20 .cse7))) (and (= .cse0 (select v_prenex_20 .cse1)) (= main_x .cse1) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 (select v_prenex_20 (+ v_subst_5 (- 1)))) (= .cse2 .cse3) (= 1000 .cse4) (= .cse0 .cse5) (= (let ((.cse6 (store v_prenex_20 main_x .cse5))) (store .cse6 main_y (select .cse6 .cse1))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 .cse0) (= .cse3 1000))))))) (let ((.cse17 (mod (+ v_subst_4 1) 256))) (let ((.cse18 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse18 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse11 (select v_main_a_34 .cse20)) (.cse14 (mod (+ .cse20 1) 256)) (.cse12 (select v_main_a_34 .cse19)) (.cse13 (select v_main_a_34 .cse18)) (.cse15 (select v_main_a_34 (+ v_subst_4 (- 1))))) (and (= .cse11 .cse12) (= .cse13 .cse12) (= main_y (mod (+ .cse14 1) 256)) (= .cse15 1000) (= (select v_main_a_34 v_subst_4) 0) (= .cse13 1000) (= main_a (let ((.cse16 (store v_main_a_34 main_x .cse11))) (store .cse16 main_y (select .cse16 .cse14)))) (= main_x .cse14) (= (select v_main_a_34 .cse14) .cse12) (= .cse13 (select v_main_a_34 .cse17)) (= .cse15 (select v_main_a_34 (mod v_subst_4 256)))))))))) [2019-01-07 14:18:22,017 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_5, v_subst_4]. (let ((.cse0 (select main_a main_x))) (or (let ((.cse7 (mod (+ v_subst_5 1) 256))) (let ((.cse8 (mod (+ .cse7 1) 256))) (let ((.cse9 (mod (+ .cse8 1) 256))) (let ((.cse10 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a v_subst_5)) (.cse5 (mod (+ .cse10 1) 256)) (.cse1 (select main_a .cse10)) (.cse2 (select main_a .cse9)) (.cse6 (select main_a .cse8)) (.cse4 (select main_a .cse7))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 .cse4) (= .cse3 (select main_a (+ v_subst_5 (- 1)))) (= main_x .cse5) (= .cse6 1000) (= main_y (mod (+ .cse5 1) 256)) (= (select main_a main_y) .cse1) (= .cse2 .cse6) (= v_subst_5 (mod v_subst_5 256)) (= .cse4 1000))))))) (let ((.cse11 (mod (+ v_subst_4 1) 256))) (let ((.cse20 (mod (+ .cse11 1) 256))) (let ((.cse19 (mod (+ .cse20 1) 256))) (let ((.cse18 (mod (+ .cse19 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse12 (select main_a .cse20)) (.cse16 (select main_a (+ v_subst_4 (- 1)))) (.cse13 (select main_a .cse19)) (.cse15 (select main_a .cse18)) (.cse14 (mod (+ .cse17 1) 256))) (and (= (select main_a .cse11) .cse12) (= .cse13 .cse12) (= 1000 .cse12) (= main_y .cse14) (= 0 (select main_a v_subst_4)) (= .cse15 .cse0) (= 1000 .cse16) (= (select main_a (mod v_subst_4 256)) .cse16) (= main_x .cse17) (= .cse13 .cse15) (= .cse15 (select main_a .cse14))))))))))) [2019-01-07 14:18:47,792 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-07 14:19:06,745 WARN L181 SmtUtils]: Spent 18.84 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-07 14:19:06,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:07,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:08,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:08,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:08,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:08,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:09,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:10,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,846 INFO L303 Elim1Store]: Index analysis took 5084 ms [2019-01-07 14:19:11,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 1173 [2019-01-07 14:19:11,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:11,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 1238 [2019-01-07 14:19:11,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:19:18,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:19:51,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,447 INFO L303 Elim1Store]: Index analysis took 253 ms [2019-01-07 14:19:51,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 1091 [2019-01-07 14:19:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:19:51,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 863 [2019-01-07 14:19:51,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:19:52,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:19:58,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:19:58,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:689, output treesize:557 [2019-01-07 14:20:00,197 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:20:00,198 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_main_a_35, v_subst_4, v_prenex_21, v_subst_5]. (or (let ((.cse5 (mod (+ v_subst_4 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse9 (mod (+ .cse11 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse10 (mod (+ .cse8 1) 256))) (let ((.cse7 (select v_main_a_35 .cse10)) (.cse0 (select v_main_a_35 .cse11)) (.cse4 (select v_main_a_35 (+ v_subst_4 (- 1)))) (.cse2 (mod (+ .cse10 1) 256)) (.cse1 (select v_main_a_35 .cse9)) (.cse3 (select v_main_a_35 .cse8))) (and (= .cse0 .cse1) (= (select v_main_a_35 .cse2) .cse3) (= .cse4 (select v_main_a_35 (mod v_subst_4 256))) (= .cse0 (select v_main_a_35 .cse5)) (= (select v_main_a_35 v_subst_4) 0) (= main_x .cse2) (= (let ((.cse6 (store v_main_a_35 main_x .cse7))) (store .cse6 main_y (select .cse6 .cse2))) main_a) (= .cse7 .cse3) (= .cse0 1000) (= .cse4 1000) (= main_y (mod (+ .cse2 1) 256)) (= .cse1 .cse3)))))))) (let ((.cse24 (mod (+ v_subst_5 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse20 (mod (+ .cse22 1) 256))) (let ((.cse21 (mod (+ .cse20 1) 256))) (let ((.cse12 (select v_prenex_21 .cse24)) (.cse13 (mod (+ .cse21 1) 256)) (.cse15 (select v_prenex_21 .cse23)) (.cse17 (select v_prenex_21 v_subst_5)) (.cse16 (select v_prenex_21 .cse22)) (.cse19 (select v_prenex_21 .cse21)) (.cse14 (select v_prenex_21 .cse20))) (and (= .cse12 1000) (= (select v_prenex_21 .cse13) .cse14) (= .cse15 .cse16) (= .cse12 .cse17) (= (mod (+ .cse13 1) 256) main_y) (= main_x .cse13) (= main_a (let ((.cse18 (store v_prenex_21 main_x .cse19))) (store .cse18 main_y (select .cse18 .cse13)))) (= 1000 .cse15) (= .cse17 (select v_prenex_21 (+ v_subst_5 (- 1)))) (= .cse14 .cse16) (= .cse19 .cse14) (= v_subst_5 (mod v_subst_5 256)))))))))) [2019-01-07 14:20:00,198 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse7 (select main_a main_y))) (or (let ((.cse2 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse2 1) 256))) (let ((.cse4 (mod (+ .cse10 1) 256))) (let ((.cse9 (mod (+ .cse4 1) 256))) (let ((.cse8 (mod (+ .cse9 1) 256))) (let ((.cse3 (select main_a .cse10)) (.cse5 (select main_a (+ v_subst_4 (- 1)))) (.cse0 (mod (+ .cse8 1) 256)) (.cse6 (select main_a .cse9)) (.cse1 (select main_a .cse8))) (and (= (select main_a .cse0) .cse1) (= (select main_a .cse2) .cse3) (= (select main_a .cse4) .cse3) (= 1000 .cse3) (= 0 (select main_a v_subst_4)) (= 1000 .cse5) (= main_x .cse0) (= .cse6 1000) (= (select main_a (mod v_subst_4 256)) .cse5) (= .cse7 .cse1) (= main_y (mod (+ .cse0 1) 256)) (= .cse6 .cse1)))))))) (let ((.cse18 (mod (+ v_subst_5 1) 256))) (let ((.cse17 (mod (+ .cse18 1) 256))) (let ((.cse21 (mod (+ .cse17 1) 256))) (let ((.cse19 (mod (+ .cse21 1) 256))) (let ((.cse20 (mod (+ .cse19 1) 256))) (let ((.cse12 (select main_a v_subst_5)) (.cse15 (mod (+ .cse20 1) 256)) (.cse14 (select main_a .cse21)) (.cse16 (select main_a .cse20)) (.cse11 (select main_a .cse19)) (.cse13 (select main_a .cse18))) (and (= 1000 .cse11) (= .cse12 .cse13) (= .cse14 .cse11) (= .cse12 (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ .cse15 1) 256) main_y) (= main_x .cse15) (= .cse16 (select main_a main_x)) (= .cse14 (select main_a .cse17)) (= .cse16 .cse7) (= .cse16 .cse11) (= v_subst_5 (mod v_subst_5 256)) (= .cse13 1000)))))))))) [2019-01-07 14:20:30,620 WARN L181 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 89 [2019-01-07 14:21:17,551 WARN L181 SmtUtils]: Spent 46.75 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-01-07 14:21:17,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:18,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:18,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:18,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:18,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:18,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:18,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:19,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:19,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:19,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:19,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:20,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:20,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:20,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:21,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:21,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:21,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:22,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:23,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:23,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:23,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:24,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:24,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:24,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:24,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:24,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:25,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:26,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:26,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:26,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:27,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:27,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:27,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:27,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:27,748 INFO L303 Elim1Store]: Index analysis took 10163 ms [2019-01-07 14:21:27,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 1732 [2019-01-07 14:21:28,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:21:28,131 INFO L303 Elim1Store]: Index analysis took 214 ms [2019-01-07 14:21:28,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 57 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 1417 [2019-01-07 14:21:28,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:21:46,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:22:36,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:36,945 INFO L303 Elim1Store]: Index analysis took 459 ms [2019-01-07 14:22:36,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 1540 [2019-01-07 14:22:37,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:22:37,168 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-07 14:22:37,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 1248 [2019-01-07 14:22:37,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 14:22:38,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:22:48,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-07 14:22:48,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:841, output treesize:653 [2019-01-07 14:22:50,465 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:22:50,466 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_subst_4, v_main_a_36, v_subst_5]. (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse12 (mod (+ .cse6 1) 256))) (let ((.cse5 (mod (+ .cse12 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse10 (mod (+ .cse11 1) 256))) (let ((.cse9 (mod (+ .cse10 1) 256))) (let ((.cse4 (select v_prenex_22 (+ v_subst_4 (- 1)))) (.cse0 (select v_prenex_22 .cse12)) (.cse2 (select v_prenex_22 .cse11)) (.cse1 (mod (+ .cse9 1) 256)) (.cse3 (select v_prenex_22 .cse10)) (.cse8 (select v_prenex_22 .cse9))) (and (= 1000 .cse0) (= main_y (mod (+ .cse1 1) 256)) (= .cse2 .cse3) (= .cse3 (select v_prenex_22 .cse1)) (= main_x .cse1) (= .cse4 (select v_prenex_22 (mod v_subst_4 256))) (= 0 (select v_prenex_22 v_subst_4)) (= (select v_prenex_22 .cse5) .cse0) (= .cse4 1000) (= .cse0 (select v_prenex_22 .cse6)) (= .cse2 1000) (= (let ((.cse7 (store v_prenex_22 main_x .cse8))) (store .cse7 main_y (select .cse7 .cse1))) main_a) (= .cse3 .cse8))))))))) (let ((.cse25 (mod (+ v_subst_5 1) 256))) (let ((.cse21 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse23 1) 256))) (let ((.cse26 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse26 1) 256))) (let ((.cse15 (select v_main_a_36 .cse26)) (.cse18 (select v_main_a_36 v_subst_5)) (.cse13 (select v_main_a_36 .cse25)) (.cse17 (mod (+ .cse24 1) 256)) (.cse14 (select v_main_a_36 .cse24)) (.cse20 (select v_main_a_36 .cse23)) (.cse16 (select v_main_a_36 .cse22))) (and (= 1000 .cse13) (= .cse14 .cse15) (= .cse15 .cse16) (= .cse17 main_x) (= (select v_main_a_36 (+ v_subst_5 (- 1))) .cse18) (= (select v_main_a_36 .cse17) .cse15) (= .cse18 .cse13) (= main_y (mod (+ .cse17 1) 256)) (= 1000 .cse16) (= (let ((.cse19 (store v_main_a_36 main_x .cse14))) (store .cse19 main_y (select .cse19 .cse17))) main_a) (= v_subst_5 (mod v_subst_5 256)) (= .cse20 (select v_main_a_36 .cse21)) (= .cse20 .cse16)))))))))) [2019-01-07 14:22:50,466 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_4, v_subst_5]. (let ((.cse2 (select main_a main_y)) (.cse4 (select main_a main_x))) (or (let ((.cse6 (mod (+ v_subst_4 1) 256))) (let ((.cse10 (mod (+ .cse6 1) 256))) (let ((.cse8 (mod (+ .cse10 1) 256))) (let ((.cse5 (mod (+ .cse8 1) 256))) (let ((.cse11 (mod (+ .cse5 1) 256))) (let ((.cse12 (mod (+ .cse11 1) 256))) (let ((.cse0 (mod (+ .cse12 1) 256)) (.cse3 (select main_a .cse12)) (.cse1 (select main_a .cse11)) (.cse7 (select main_a .cse10)) (.cse9 (select main_a (+ v_subst_4 (- 1))))) (and (= main_y (mod (+ .cse0 1) 256)) (= main_x .cse0) (= 1000 .cse1) (= .cse2 .cse3) (= .cse4 .cse3) (= (select main_a .cse5) .cse1) (= .cse3 .cse1) (= (select main_a .cse6) .cse7) (= (select main_a .cse8) .cse7) (= 1000 .cse7) (= 0 (select main_a v_subst_4)) (= 1000 .cse9) (= (select main_a (mod v_subst_4 256)) .cse9))))))))) (let ((.cse21 (mod (+ v_subst_5 1) 256))) (let ((.cse20 (mod (+ .cse21 1) 256))) (let ((.cse22 (mod (+ .cse20 1) 256))) (let ((.cse25 (mod (+ .cse22 1) 256))) (let ((.cse24 (mod (+ .cse25 1) 256))) (let ((.cse23 (mod (+ .cse24 1) 256))) (let ((.cse13 (select main_a .cse25)) (.cse15 (mod (+ .cse23 1) 256)) (.cse18 (select main_a .cse24)) (.cse14 (select main_a .cse23)) (.cse17 (select main_a v_subst_5)) (.cse16 (select main_a .cse22)) (.cse19 (select main_a .cse21))) (and (= 1000 .cse13) (= .cse2 .cse14) (= .cse4 .cse14) (= .cse15 main_x) (= .cse16 .cse13) (= .cse17 (select main_a (+ v_subst_5 (- 1)))) (= .cse18 1000) (= main_y (mod (+ .cse15 1) 256)) (= .cse18 .cse14) (= .cse17 .cse19) (= .cse16 (select main_a .cse20)) (= v_subst_5 (mod v_subst_5 256)) (= .cse19 1000))))))))))) [2019-01-07 14:23:33,125 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 96 [2019-01-07 14:23:33,260 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {323#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} is VALID [2019-01-07 14:23:34,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {323#(and (= (select main_a main_x) 1000) (= (select main_a main_y) 0) (= main_y (+ main_x 1)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {327#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} is VALID [2019-01-07 14:23:36,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#(or (exists ((main_yold Int)) (and (= (mod main_yold 256) main_x) (= 0 (select main_a main_yold)) (= main_y (mod (+ main_yold 1) 256)) (= (select main_a main_y) (select main_a main_yold)) (= (select main_a main_x) (select main_a (+ main_yold (- 1)))) (= 1000 (select main_a (+ main_yold (- 1)))))) (and (= main_y (mod (+ main_x 1) 256)) (= (select main_a main_y) (select main_a (+ main_x (- 1)))) (= main_x (mod main_x 256)) (= 1000 (select main_a (+ main_x (- 1)))) (= (select main_a main_x) (select main_a (+ main_x (- 1))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} is UNKNOWN [2019-01-07 14:23:38,496 INFO L273 TraceCheckUtils]: 3: Hoare triple {331#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod v_subst_4 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a main_y)))) (exists ((main_xold Int)) (and (= main_xold (mod main_xold 256)) (= (select main_a main_xold) (select main_a (+ main_xold (- 1)))) (= (select main_a main_x) (select main_a main_xold)) (= main_x (mod (+ main_xold 1) 256)) (= main_y (mod (+ (mod (+ main_xold 1) 256) 1) 256)) (= 1000 (select main_a (+ main_xold (- 1)))) (= (select main_a main_xold) (select main_a (mod (+ (mod (+ main_xold 1) 256) 1) 256))))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a v_subst_5) 1000) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} is UNKNOWN [2019-01-07 14:23:40,510 INFO L273 TraceCheckUtils]: 4: Hoare triple {335#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod v_subst_4 256)) (select main_a (mod (+ v_subst_4 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ v_subst_4 1) 256) 1) 256)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a main_x)))) (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a v_subst_5) 1000) (= main_y (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {339#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)))))} is UNKNOWN [2019-01-07 14:23:42,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ v_subst_5 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) (select main_a main_y)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)))) (exists ((v_subst_4 Int)) (and (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod (+ v_subst_4 1) 256)) 1000) (= (select main_a main_x) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} is UNKNOWN [2019-01-07 14:23:44,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(or (exists ((v_subst_5 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))) (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) main_x))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {347#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-07 14:23:46,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {347#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= 0 (select main_a v_subst_4)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {351#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-07 14:23:48,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(or (exists ((v_subst_4 Int)) (and (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_y) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_x)) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a main_y)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {355#(or (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} is UNKNOWN [2019-01-07 14:23:48,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#(or (exists ((v_subst_4 Int)) (and (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= main_x (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_4 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= (select main_a (mod (+ v_subst_4 1) 256)) (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 1000 (select main_a (mod (+ (mod (+ v_subst_4 1) 256) 1) 256))) (= 0 (select main_a v_subst_4)) (= 1000 (select main_a (+ v_subst_4 (- 1)))) (= (select main_a (mod v_subst_4 256)) (select main_a (+ v_subst_4 (- 1)))))) (exists ((v_subst_5 Int)) (and (= 1000 (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_y) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a main_x) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256))) (= (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) main_x) (= (select main_a v_subst_5) (select main_a (+ v_subst_5 (- 1)))) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) 1000) (= main_y (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (= (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256) 1) 256) 1) 256) 1) 256))) (= (select main_a v_subst_5) (select main_a (mod (+ v_subst_5 1) 256))) (= (select main_a (mod (+ (mod (+ (mod (+ v_subst_5 1) 256) 1) 256) 1) 256)) (select main_a (mod (+ (mod (+ v_subst_5 1) 256) 1) 256))) (= v_subst_5 (mod v_subst_5 256)) (= (select main_a (mod (+ v_subst_5 1) 256)) 1000))))} assume a[x] == 0; {314#false} is VALID [2019-01-07 14:23:48,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {314#false} assume !(a[y] == 1000); {314#false} is VALID [2019-01-07 14:23:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:23:48,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:24:13,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#(= (select main_a main_y) 1000)} assume !(a[y] == 1000); {314#false} is VALID [2019-01-07 14:24:13,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} assume a[x] == 0; {362#(= (select main_a main_y) 1000)} is VALID [2019-01-07 14:24:13,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {366#(or (not (= (select main_a main_x) 0)) (= (select main_a main_y) 1000))} is VALID [2019-01-07 14:24:13,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {370#(or (not (= 0 (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256)))) (= 1000 (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)))} is VALID [2019-01-07 14:24:13,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:24:15,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is UNKNOWN [2019-01-07 14:24:17,102 INFO L273 TraceCheckUtils]: 4: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:24:17,233 INFO L273 TraceCheckUtils]: 3: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:24:17,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:24:19,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} xold := x;yold := y;x := (x + 1) % 256;y := (y + 1) % 256;a := a[x := a[xold]];a := a[y := a[yold]]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is UNKNOWN [2019-01-07 14:24:19,477 INFO L273 TraceCheckUtils]: 0: Hoare triple {313#true} y := x + 1;a := a[x := 1000];a := a[y := 0]; {374#(or (not (= 0 (select (store (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ (mod (+ main_y 1) 256) 1) 256) (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))) (mod (+ (mod (+ main_x 1) 256) 1) 256)))) (= 1000 (select (store (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ (mod (+ main_x 1) 256) 1) 256) (select (store (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) (mod (+ main_y 1) 256) (select (store main_a (mod (+ main_x 1) 256) (select main_a main_x)) main_y)) (mod (+ main_x 1) 256))) (mod (+ main_y 1) 256))))} is VALID [2019-01-07 14:24:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 14:24:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:24:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 4] total 19 [2019-01-07 14:24:19,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:24:19,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-07 14:24:19,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:24:19,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-07 14:24:35,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 11 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2019-01-07 14:24:35,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 14:24:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 14:24:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=212, Unknown=46, NotChecked=0, Total=380 [2019-01-07 14:24:35,649 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-07 14:28:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:28:23,799 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-07 14:28:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 14:28:23,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-07 14:28:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:28:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 14:28:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 14:28:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 14:28:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 14:28:23,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 14 transitions. [2019-01-07 14:28:39,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 6 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2019-01-07 14:28:39,964 INFO L225 Difference]: With dead ends: 13 [2019-01-07 14:28:39,964 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:28:39,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 138.7s TimeCoverageRelationStatistics Valid=122, Invalid=212, Unknown=46, NotChecked=0, Total=380 [2019-01-07 14:28:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:28:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:28:39,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:28:39,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:28:39,966 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:28:39,966 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:28:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:28:39,966 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:28:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:28:39,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:28:39,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:28:39,966 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:28:39,966 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:28:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:28:39,967 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:28:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:28:39,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:28:39,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:28:39,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:28:39,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:28:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:28:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:28:39,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-07 14:28:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:28:39,967 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:28:39,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 14:28:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:28:39,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:28:39,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.