java -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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:38:28,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:38:28,793 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:38:28,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:38:28,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:38:28,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:38:28,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:38:28,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:38:28,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:38:28,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:38:28,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:38:28,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:38:28,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:38:28,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:38:28,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:38:28,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:38:28,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:38:28,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:38:28,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:38:28,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:38:28,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:38:28,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:38:28,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:38:28,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:38:28,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:38:28,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:38:28,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:38:28,833 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:38:28,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:38:28,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:38:28,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:38:28,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:38:28,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:38:28,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:38:28,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:38:28,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:38:28,839 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:38:28,864 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:38:28,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:38:28,867 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:38:28,867 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:38:28,867 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:38:28,867 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:38:28,868 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:38:28,868 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:38:28,868 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:38:28,868 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:38:28,868 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:38:28,869 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:38:28,869 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:38:28,869 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:38:28,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:38:28,870 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:38:28,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:38:28,870 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:38:28,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:38:28,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:38:28,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:38:28,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:38:28,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:38:28,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:38:28,872 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:38:28,872 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:38:28,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:38:28,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:38:28,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:38:28,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:38:28,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:28,873 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:38:28,873 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:38:28,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:38:28,874 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:38:28,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:38:28,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:38:28,874 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:38:28,874 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:38:28,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:38:28,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:38:28,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:38:28,938 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:38:28,939 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:38:28,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-20 10:38:28,940 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-20 10:38:28,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:38:28,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:38:28,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:28,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:38:28,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:38:29,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:29,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:38:29,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:38:29,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:38:29,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/1) ... [2019-01-20 10:38:29,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:38:29,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:38:29,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:38:29,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:38:29,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (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-20 10:38:29,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:38:29,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:38:29,390 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:38:29,391 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-20 10:38:29,392 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:29 BoogieIcfgContainer [2019-01-20 10:38:29,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:38:29,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:38:29,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:38:29,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:38:29,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:28" (1/2) ... [2019-01-20 10:38:29,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7b8bd6 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:38:29, skipping insertion in model container [2019-01-20 10:38:29,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:29" (2/2) ... [2019-01-20 10:38:29,400 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-20 10:38:29,410 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:38:29,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-20 10:38:29,438 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-20 10:38:29,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:38:29,475 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:38:29,475 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:38:29,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:38:29,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:38:29,476 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:38:29,476 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:38:29,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:38:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-20 10:38:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:38:29,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:29,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:38:29,502 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-20 10:38:29,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:29,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:29,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:29,726 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-20 10:38:29,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:29,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:29,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:29,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:29,760 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-20 10:38:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:29,931 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-20 10:38:29,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:29,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:38:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:29,947 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:38:29,948 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 10:38:29,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 10:38:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-20 10:38:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 10:38:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-20 10:38:29,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-20 10:38:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:29,986 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-20 10:38:29,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-20 10:38:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:29,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:29,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:29,988 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-20 10:38:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:29,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:30,169 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-20 10:38:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:30,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:30,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:30,173 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-20 10:38:30,224 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:30,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:38,612 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:38,615 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:38:38,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:38,621 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:40,230 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-20 10:38:40,231 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:41,301 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-20 10:38:41,302 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:41,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:41,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-20 10:38:41,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:41,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:41,308 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2019-01-20 10:38:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:48,530 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. [2019-01-20 10:38:48,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:48,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:38:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:48,532 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:38:48,533 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 10:38:48,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 10:38:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-20 10:38:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:38:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2019-01-20 10:38:48,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 3 [2019-01-20 10:38:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:48,541 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. [2019-01-20 10:38:48,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. [2019-01-20 10:38:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:48,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:48,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:48,546 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-20 10:38:48,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:48,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:48,613 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-20 10:38:48,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:48,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:48,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:48,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:48,614 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 3 states. [2019-01-20 10:38:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:48,713 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. [2019-01-20 10:38:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:48,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:48,715 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:38:48,715 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 10:38:48,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 10:38:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-20 10:38:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:38:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2019-01-20 10:38:48,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 3 [2019-01-20 10:38:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:48,724 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 26 transitions. [2019-01-20 10:38:48,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 26 transitions. [2019-01-20 10:38:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:48,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:48,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:48,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-20 10:38:48,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:48,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:48,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:48,812 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-20 10:38:48,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:48,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:48,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:48,813 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-20 10:38:48,816 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:48,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:55,044 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:55,044 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:38:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:55,045 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:57,502 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2019-01-20 10:38:57,503 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:58,698 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-20 10:38:58,698 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:58,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:58,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-01-20 10:38:58,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:58,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:58,700 INFO L87 Difference]: Start difference. First operand 14 states and 26 transitions. Second operand 3 states. [2019-01-20 10:38:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:59,078 INFO L93 Difference]: Finished difference Result 16 states and 32 transitions. [2019-01-20 10:38:59,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:59,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:59,080 INFO L225 Difference]: With dead ends: 16 [2019-01-20 10:38:59,080 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 10:38:59,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 10:38:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 10:38:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:38:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2019-01-20 10:38:59,090 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 31 transitions. Word has length 3 [2019-01-20 10:38:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 31 transitions. [2019-01-20 10:38:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 31 transitions. [2019-01-20 10:38:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:59,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:59,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:59,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-20 10:38:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:59,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:59,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:59,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:59,302 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-20 10:38:59,308 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-20 10:38:59,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:59,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:59,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:59,311 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-20 10:38:59,314 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:59,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:06,047 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:39:06,047 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:39:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:06,048 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:39:07,112 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-20 10:39:07,112 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:39:08,146 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-20 10:39:08,147 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:39:08,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:39:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-20 10:39:08,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:08,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:08,149 INFO L87 Difference]: Start difference. First operand 15 states and 31 transitions. Second operand 4 states. [2019-01-20 10:39:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:09,060 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2019-01-20 10:39:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:09,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:39:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:09,061 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:39:09,061 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 10:39:09,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 10:39:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-01-20 10:39:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:39:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-20 10:39:09,068 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-20 10:39:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:09,069 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-20 10:39:09,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-20 10:39:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:09,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:09,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:09,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-20 10:39:09,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:09,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:09,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:09,145 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-20 10:39:09,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:09,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:09,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:09,146 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-20 10:39:09,147 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:09,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:17,215 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:39:17,216 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:39:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:17,216 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:39:18,443 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-20 10:39:18,443 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:39:20,824 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:39:20,825 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:39:20,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:39:20,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-20 10:39:20,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:20,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:39:20,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:39:20,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:20,826 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 5 states. [2019-01-20 10:39:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:31,954 INFO L93 Difference]: Finished difference Result 20 states and 44 transitions. [2019-01-20 10:39:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:39:31,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-20 10:39:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:31,956 INFO L225 Difference]: With dead ends: 20 [2019-01-20 10:39:31,956 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:39:31,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:39:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-20 10:39:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:39:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-01-20 10:39:31,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 4 [2019-01-20 10:39:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:31,968 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-01-20 10:39:31,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:39:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-01-20 10:39:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:31,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:31,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:31,969 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-01-20 10:39:31,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:31,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:31,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:32,075 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-20 10:39:32,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:32,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:32,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:32,076 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-20 10:39:32,077 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:32,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:47,763 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:39:47,764 INFO L272 AbstractInterpreter]: Visited 4 different actions 34 times. Merged at 2 different actions 10 times. Widened at 2 different actions 6 times. Found 12 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:47,764 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:39:49,108 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 70.83% of their original sizes. [2019-01-20 10:39:49,109 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:39:51,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_555 Int) (v_idx_556 Int) (v_idx_553 Int) (v_idx_554 Int) (v_idx_557 Int) (v_idx_551 Int) (v_idx_552 Int)) (let ((.cse49 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse11 (<= .cse49 c_ULTIMATE.start_main_p4))) (and (let ((.cse3 (select |c_#memory_int| v_idx_551))) (let ((.cse5 (<= .cse7 v_idx_551)) (.cse1 (<= 0 (* 2 .cse3))) (.cse4 (<= 0 .cse3)) (.cse6 (< v_idx_551 c_ULTIMATE.start_main_p1))) (let ((.cse0 (or .cse5 (and .cse1 .cse4) .cse6))) (or (and .cse0 (< v_idx_557 c_ULTIMATE.start_main_p4)) (and .cse0 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_557)) (let ((.cse2 (select |c_#memory_int| v_idx_557))) (and (or (and .cse1 (<= .cse2 .cse3) .cse4) .cse5 .cse6) (<= (* 2 .cse2) 0) (<= .cse2 0))))))) (let ((.cse48 (+ v_idx_553 3)) (.cse47 (+ v_idx_556 1)) (.cse46 (+ v_idx_554 2)) (.cse42 (+ c_ULTIMATE.start_main_p1 2))) (let ((.cse40 (<= (+ v_idx_555 1) v_idx_554)) (.cse37 (<= v_idx_556 v_idx_554)) (.cse33 (<= .cse42 v_idx_554)) (.cse45 (<= .cse46 v_idx_555)) (.cse35 (<= .cse47 v_idx_555)) (.cse34 (<= .cse49 v_idx_555)) (.cse43 (<= .cse48 v_idx_555)) (.cse41 (<= (+ v_idx_555 2) c_ULTIMATE.start_main_p4)) (.cse39 (= (select |c_#memory_int| v_idx_555) 0)) (.cse38 (<= c_ULTIMATE.start_main_p4 v_idx_556)) (.cse20 (<= .cse48 c_ULTIMATE.start_main_p4)) (.cse36 (<= .cse47 c_ULTIMATE.start_main_p4)) (.cse15 (<= .cse46 c_ULTIMATE.start_main_p4))) (let ((.cse30 (or (and .cse20 (or (and .cse20 .cse45 .cse34 .cse43 .cse11 .cse15) (and .cse20 .cse45 .cse34 .cse43 .cse11 .cse15 .cse38) (and .cse20 .cse45 .cse35 .cse34 .cse36 .cse43 .cse11 .cse15)) .cse11 .cse15) (and .cse20 (or (and .cse20 .cse11 .cse41 .cse15 .cse38) (and .cse20 .cse11 .cse41 .cse15) (and .cse20 .cse36 .cse11 .cse41 .cse15)) .cse11 .cse41 .cse15) (and .cse20 .cse39 (or (and .cse20 .cse11 .cse15) (and .cse20 .cse11 .cse15 .cse38) (and .cse20 .cse36 .cse11 .cse15)) .cse11 .cse15))) (.cse28 (or (and .cse20 (or (and .cse20 .cse11 .cse41 .cse38) (and .cse20 .cse36 .cse11 .cse41) (and .cse20 .cse11 .cse41)) .cse11 .cse41) (and (or (and .cse20 .cse11) (and .cse20 .cse11 .cse38) (and .cse20 .cse36 .cse11)) .cse20 .cse39 .cse11) (and .cse20 (or (and .cse20 .cse34 .cse43 .cse11) (and .cse20 .cse34 .cse43 .cse11 .cse38) (and .cse20 .cse35 .cse34 .cse36 .cse43 .cse11)) .cse11))) (.cse10 (or (and (or (and .cse11 .cse38) (and .cse36 .cse11) .cse11) .cse39 .cse11) (and (or (and .cse11 .cse41) (and .cse36 .cse11 .cse41) (and .cse11 .cse41 .cse38)) .cse11 .cse41) (and (or (and .cse34 .cse11 .cse38) (and .cse35 .cse34 .cse36 .cse11) (and .cse34 .cse11)) .cse11))) (.cse18 (<= (+ v_idx_554 1) v_idx_553)) (.cse16 (or (and (or (and .cse45 .cse34 .cse11 .cse15 .cse38) (and .cse45 .cse34 .cse11 .cse15) (and .cse45 .cse35 .cse34 .cse36 .cse11 .cse15)) .cse11 .cse15) (and .cse39 (or (and .cse11 .cse15) (and .cse36 .cse11 .cse15) (and .cse11 .cse15 .cse38)) .cse11 .cse15) (and (or (and .cse36 .cse11 .cse41 .cse15) (and .cse11 .cse41 .cse15) (and .cse11 .cse41 .cse15 .cse38)) .cse11 .cse41 .cse15))) (.cse22 (let ((.cse44 (<= (+ v_idx_553 2) v_idx_554))) (or (and (or (and .cse20 .cse34 .cse43 .cse44 .cse33 .cse11) (and .cse20 .cse34 .cse43 .cse44 .cse33 .cse11 .cse38) (and .cse20 .cse35 .cse34 .cse36 .cse43 .cse44 .cse37 .cse33 .cse11)) .cse20 .cse44 .cse33 .cse11) (and .cse20 .cse44 .cse33 (or (and .cse20 .cse44 .cse33 .cse11 .cse40 .cse41 .cse38) (and .cse20 .cse36 .cse44 .cse37 .cse33 .cse11 .cse40 .cse41) (and .cse20 .cse44 .cse33 .cse11 .cse40 .cse41)) .cse11 .cse40 .cse41) (and .cse20 .cse39 .cse44 .cse33 (or (and .cse20 .cse44 .cse33 .cse11 .cse38) (and .cse20 .cse36 .cse44 .cse37 .cse33 .cse11) (and .cse20 .cse44 .cse33 .cse11)) .cse11)))) (.cse13 (= (select |c_#memory_int| v_idx_553) 0)) (.cse8 (<= .cse42 v_idx_553)) (.cse23 (or (and .cse33 .cse11 (or (and .cse34 .cse33 .cse11) (and .cse35 .cse34 .cse36 .cse37 .cse33 .cse11) (and .cse34 .cse33 .cse11 .cse38))) (and .cse39 (or (and .cse33 .cse11 .cse38) (and .cse36 .cse37 .cse33 .cse11) (and .cse33 .cse11)) .cse33 .cse11) (and .cse33 .cse11 .cse40 .cse41 (or (and .cse33 .cse11 .cse40 .cse41) (and .cse33 .cse11 .cse40 .cse41 .cse38) (and .cse36 .cse37 .cse33 .cse11 .cse40 .cse41)))))) (let ((.cse19 (and .cse8 .cse23 .cse11)) (.cse24 (and .cse23 .cse13 .cse11)) (.cse25 (and .cse20 .cse22 .cse11)) (.cse21 (<= (+ v_idx_553 1) v_idx_552)) (.cse14 (<= v_idx_554 v_idx_552)) (.cse17 (and .cse18 .cse8 .cse11 .cse15 .cse16)) (.cse31 (and .cse13 .cse11 .cse15 .cse16)) (.cse27 (and .cse13 .cse10 .cse11)) (.cse12 (and .cse20 .cse11 .cse28)) (.cse29 (and .cse8 .cse10 .cse11)) (.cse26 (< v_idx_552 .cse7)) (.cse32 (and .cse20 .cse30 .cse11 .cse15)) (.cse9 (<= .cse7 v_idx_552))) (or (and .cse8 .cse9 .cse10 .cse11) .cse12 (and .cse13 .cse9 .cse11 .cse14 .cse15 .cse16) .cse17 (and .cse18 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16) .cse19 (and .cse20 .cse21 .cse22 .cse9 .cse11) (and .cse23 .cse13 .cse9 .cse11) .cse24 (and (or .cse25 .cse19 .cse24) .cse26) .cse27 (and .cse20 .cse21 .cse9 .cse11 .cse28) .cse25 .cse29 (and .cse8 .cse23 .cse9 .cse11) (and .cse20 .cse21 .cse30 .cse9 .cse11 .cse14 .cse15) .cse31 (and .cse26 (or .cse17 .cse31 .cse32)) (and (or .cse27 .cse12 .cse29) .cse26) .cse32 (and .cse13 .cse9 .cse10 .cse11)))))) .cse11)))) is different from false [2019-01-20 10:39:52,140 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:39:52,140 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:39:52,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:39:52,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-20 10:39:52,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:52,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-01-20 10:39:52,141 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 4 states. [2019-01-20 10:39:54,390 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_566 Int) (v_idx_567 Int) (v_idx_564 Int) (v_idx_565 Int) (v_idx_562 Int) (v_idx_563 Int) (v_idx_560 Int) (v_idx_561 Int)) (let ((.cse262 (+ v_idx_562 3)) (.cse261 (+ c_ULTIMATE.start_main_p1 3)) (.cse263 (+ v_idx_563 2)) (.cse264 (+ c_ULTIMATE.start_main_p1 2))) (let ((.cse243 (+ c_ULTIMATE.start_main_p1 1)) (.cse191 (<= (+ v_idx_562 2) v_idx_563)) (.cse34 (<= .cse264 v_idx_563)) (.cse55 (= (select |c_#memory_int| v_idx_562) 0)) (.cse56 (<= .cse264 v_idx_562)) (.cse215 (<= (+ v_idx_563 1) v_idx_562)) (.cse211 (<= .cse263 v_idx_564)) (.cse35 (<= .cse261 v_idx_564)) (.cse54 (<= .cse262 v_idx_564))) (let ((.cse99 (and .cse211 .cse35 .cse54)) (.cse101 (and .cse211 .cse56 .cse35 .cse215)) (.cse102 (and .cse211 .cse35 .cse55)) (.cse68 (and .cse56 .cse34)) (.cse63 (and .cse34 .cse191)) (.cse67 (and .cse55 .cse34)) (.cse214 (<= (+ v_idx_563 3) v_idx_566)) (.cse212 (<= v_idx_563 v_idx_561)) (.cse213 (<= .cse263 v_idx_565)) (.cse146 (and .cse35 .cse54)) (.cse147 (and .cse56 .cse35)) (.cse155 (and .cse35 .cse55)) (.cse50 (<= .cse262 v_idx_565)) (.cse51 (<= (+ v_idx_562 4) v_idx_566)) (.cse27 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_566)) (.cse8 (<= .cse261 v_idx_565)) (.cse53 (<= (+ v_idx_562 1) v_idx_561)) (.cse23 (< v_idx_561 .cse243)) (.cse86 (and .cse56 .cse35 .cse34)) (.cse81 (and .cse35 .cse55 .cse34)) (.cse89 (and .cse35 .cse34 .cse54 .cse191)) (.cse52 (<= .cse243 v_idx_561))) (let ((.cse84 (and .cse56 .cse35 .cse52 .cse34)) (.cse80 (and .cse23 (or .cse86 .cse81 .cse89))) (.cse85 (and .cse35 .cse55 .cse52 .cse34)) (.cse83 (and .cse35 .cse52 .cse34 .cse53 .cse54 .cse191)) (.cse247 (select |c_#memory_int| v_idx_566)) (.cse139 (or (and .cse27 .cse55 .cse52 .cse8) (and .cse56 .cse27 .cse52 .cse8) (and .cse50 .cse51 .cse27 .cse52 .cse53 .cse8))) (.cse140 (or (and .cse56 .cse27 .cse8) (and .cse27 .cse55 .cse8) (and .cse50 .cse51 .cse27 .cse8))) (.cse133 (or (and .cse55 .cse52 .cse8) (and .cse56 .cse52 .cse8) (and .cse50 .cse52 .cse53 .cse8))) (.cse134 (or (and .cse50 .cse8) (and .cse56 .cse8) (and .cse55 .cse8))) (.cse143 (and .cse56 .cse35 .cse52)) (.cse144 (and .cse23 (or .cse146 .cse147 .cse155))) (.cse148 (and .cse35 .cse52 .cse53 .cse54)) (.cse150 (and .cse35 .cse55 .cse52)) (.cse117 (or (and .cse50 .cse212 .cse52 .cse53 .cse213 .cse8) (and .cse212 .cse55 .cse52 .cse213 .cse8) (and .cse56 .cse212 .cse52 .cse213 .cse215 .cse8))) (.cse120 (or (and .cse55 .cse213 .cse8) (and .cse56 .cse213 .cse215 .cse8) (and .cse50 .cse213 .cse8))) (.cse18 (<= (+ v_idx_566 1) v_idx_565)) (.cse121 (or (and .cse212 .cse27 .cse55 .cse52 .cse213 .cse214 .cse8) (and .cse56 .cse212 .cse27 .cse52 .cse213 .cse215 .cse214 .cse8) (and .cse50 .cse51 .cse212 .cse27 .cse52 .cse53 .cse213 .cse214 .cse8))) (.cse3 (<= (+ v_idx_564 2) v_idx_565)) (.cse21 (<= v_idx_567 v_idx_565)) (.cse31 (<= (+ v_idx_567 1) v_idx_566)) (.cse29 (<= (+ v_idx_564 3) v_idx_566)) (.cse124 (or (and .cse27 .cse55 .cse213 .cse214 .cse8) (and .cse50 .cse51 .cse27 .cse213 .cse214 .cse8) (and .cse56 .cse27 .cse213 .cse215 .cse214 .cse8))) (.cse61 (and .cse55 .cse52 .cse34)) (.cse65 (and .cse56 .cse52 .cse34)) (.cse66 (and .cse52 .cse34 .cse53 .cse191)) (.cse72 (and .cse23 (or .cse68 .cse63 .cse67))) (.cse248 (select |c_#memory_int| v_idx_560)) (.cse104 (and .cse211 .cse212 .cse35 .cse55 .cse52)) (.cse105 (and .cse211 .cse212 .cse35 .cse52 .cse53 .cse54)) (.cse98 (and .cse23 (or .cse99 .cse101 .cse102))) (.cse108 (and .cse211 .cse56 .cse212 .cse35 .cse52 .cse215))) (let ((.cse242 (or .cse104 .cse105 .cse98 .cse99 .cse108 .cse101 .cse102)) (.cse0 (<= 0 (* 2 .cse248))) (.cse1 (<= 0 .cse248)) (.cse244 (or .cse61 .cse68 .cse63 .cse65 .cse66 .cse72 .cse67)) (.cse2 (and .cse3 (let ((.cse259 (and .cse3 .cse27 .cse21 .cse31 .cse29 .cse124 .cse8)) (.cse260 (and .cse3 .cse27 .cse29 .cse124 .cse8))) (or (and .cse3 .cse27 .cse121 .cse29 .cse8) .cse259 .cse260 (and .cse23 (or .cse259 .cse260)) (and .cse3 .cse27 .cse21 .cse31 .cse121 .cse29 .cse8))) .cse8)) (.cse9 (and (let ((.cse257 (and .cse120 .cse3 .cse18 .cse8)) (.cse258 (and .cse120 .cse3 .cse18 .cse21 .cse8))) (or .cse257 (and .cse23 (or .cse257 .cse258)) (and .cse3 .cse117 .cse18 .cse8) .cse258 (and .cse3 .cse117 .cse18 .cse21 .cse8))) .cse3 .cse18 .cse8)) (.cse4 (let ((.cse255 (and .cse120 .cse3 .cse21 .cse8)) (.cse256 (and .cse120 .cse3 .cse8))) (or (and .cse3 .cse117 .cse8) (and .cse3 .cse117 .cse21 .cse8) .cse255 .cse256 (and .cse23 (or .cse255 .cse256))))) (.cse245 (or .cse143 .cse144 .cse146 .cse147 .cse148 .cse150 .cse155)) (.cse165 (and .cse3 .cse18 (let ((.cse253 (and .cse3 .cse134 .cse18 .cse21 .cse8)) (.cse254 (and .cse3 .cse134 .cse18 .cse8))) (or (and .cse3 .cse18 .cse133 .cse8) (and .cse3 .cse18 .cse21 .cse133 .cse8) (and .cse23 (or .cse253 .cse254)) .cse253 .cse254)) .cse8)) (.cse166 (and .cse3 (let ((.cse251 (and .cse3 .cse27 .cse21 .cse31 .cse140 .cse29 .cse8)) (.cse252 (and .cse3 .cse27 .cse140 .cse29 .cse8))) (or (and .cse23 (or .cse251 .cse252)) .cse251 (and .cse3 .cse139 .cse27 .cse21 .cse31 .cse29 .cse8) (and .cse3 .cse139 .cse27 .cse29 .cse8) .cse252)) .cse8)) (.cse167 (let ((.cse249 (and .cse3 .cse134 .cse8)) (.cse250 (and .cse3 .cse134 .cse21 .cse8))) (or .cse249 (and .cse3 .cse21 .cse133 .cse8) .cse250 (and .cse3 .cse133 .cse8) (and .cse23 (or .cse249 .cse250))))) (.cse5 (<= (* 2 .cse247) 0)) (.cse6 (<= .cse247 0)) (.cse7 (<= .cse247 .cse248)) (.cse246 (or .cse84 .cse80 .cse85 .cse86 .cse81 .cse89 .cse83))) (let ((.cse91 (and .cse5 .cse6 .cse7 .cse246)) (.cse92 (and .cse5 .cse6 .cse246)) (.cse93 (or (and .cse51 .cse27 .cse35 .cse52 .cse34 .cse53 .cse54 .cse191) (and .cse56 .cse27 .cse35 .cse52 .cse34) (and .cse27 .cse35 .cse55 .cse52 .cse34))) (.cse94 (or (and .cse51 .cse27 .cse35 .cse34 .cse54 .cse191) (and .cse56 .cse27 .cse35 .cse34) (and .cse27 .cse35 .cse55 .cse34))) (.cse95 (<= (+ v_idx_565 1) v_idx_564)) (.cse28 (or (and .cse50 .cse51 .cse27 .cse52 .cse34 .cse53 .cse191 .cse8) (and .cse27 .cse55 .cse52 .cse34 .cse8) (and .cse56 .cse27 .cse52 .cse34 .cse8))) (.cse33 (or (and .cse50 .cse51 .cse27 .cse34 .cse191 .cse8) (and .cse56 .cse27 .cse34 .cse8) (and .cse27 .cse55 .cse34 .cse8))) (.cse20 (or (and .cse50 .cse52 .cse34 .cse53 .cse191 .cse8) (and .cse56 .cse52 .cse34 .cse8) (and .cse55 .cse52 .cse34 .cse8))) (.cse24 (or (and .cse55 .cse34 .cse8) (and .cse56 .cse34 .cse8) (and .cse50 .cse34 .cse191 .cse8))) (.cse12 (<= (+ v_idx_564 1) v_idx_563)) (.cse10 (or .cse165 .cse166 (and .cse3 .cse167 .cse5 .cse6 .cse8))) (.cse153 (and .cse5 .cse245 .cse6 .cse7)) (.cse156 (and .cse5 .cse245 .cse6)) (.cse157 (or (and .cse56 .cse27 .cse35 .cse52) (and .cse51 .cse27 .cse35 .cse52 .cse53 .cse54) (and .cse27 .cse35 .cse55 .cse52))) (.cse158 (or (and .cse56 .cse27 .cse35) (and .cse27 .cse35 .cse55) (and .cse51 .cse27 .cse35 .cse54))) (.cse141 (or .cse2 .cse9 (and .cse3 .cse4 .cse5 .cse6 .cse8))) (.cse62 (and .cse5 .cse6 .cse7 .cse244)) (.cse73 (and .cse5 .cse6 .cse244)) (.cse74 (or (and .cse27 .cse55 .cse52 .cse34) (and .cse51 .cse27 .cse52 .cse34 .cse53 .cse191) (and .cse56 .cse27 .cse52 .cse34))) (.cse76 (or (and .cse51 .cse27 .cse34 .cse191) (and .cse56 .cse27 .cse34) (and .cse27 .cse55 .cse34))) (.cse75 (<= (+ v_idx_565 2) v_idx_566)) (.cse58 (= (select |c_#memory_int| v_idx_564) 0)) (.cse77 (<= v_idx_565 v_idx_563)) (.cse57 (and .cse0 .cse1)) (.cse11 (<= .cse243 v_idx_560)) (.cse106 (and .cse5 .cse242 .cse6 .cse7)) (.cse14 (< v_idx_560 c_ULTIMATE.start_main_p1)) (.cse110 (and .cse5 .cse242 .cse6)) (.cse111 (or (and .cse211 .cse51 .cse212 .cse27 .cse35 .cse52 .cse53 .cse54 .cse214) (and .cse211 .cse56 .cse212 .cse27 .cse35 .cse52 .cse215 .cse214) (and .cse211 .cse212 .cse27 .cse35 .cse55 .cse52 .cse214))) (.cse112 (or (and .cse211 .cse56 .cse27 .cse35 .cse215 .cse214) (and .cse211 .cse27 .cse35 .cse55 .cse214) (and .cse211 .cse51 .cse27 .cse35 .cse54 .cse214)))) (or (and .cse0 .cse1 (or .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9)) (and .cse10 .cse11) (and .cse12 (let ((.cse15 (and .cse3 (let ((.cse30 (and .cse3 .cse27 .cse21 .cse31 .cse33 .cse29 .cse8)) (.cse32 (and .cse3 .cse27 .cse33 .cse29 .cse8))) (or (and .cse3 .cse27 .cse28 .cse29 .cse8) .cse30 (and .cse3 .cse27 .cse21 .cse31 .cse28 .cse29 .cse8) .cse32 (and .cse23 (or .cse30 .cse32)))) .cse8)) (.cse16 (let ((.cse25 (and .cse3 .cse24 .cse8)) (.cse26 (and .cse3 .cse21 .cse24 .cse8))) (or .cse25 (and .cse3 .cse20 .cse8) (and .cse23 (or .cse25 .cse26)) .cse26 (and .cse3 .cse20 .cse21 .cse8)))) (.cse17 (and .cse3 .cse18 (let ((.cse19 (and .cse3 .cse18 .cse24 .cse8)) (.cse22 (and .cse3 .cse18 .cse21 .cse24 .cse8))) (or .cse19 (and .cse3 .cse20 .cse18 .cse21 .cse8) (and (or .cse19 .cse22) .cse23) (and .cse3 .cse20 .cse18 .cse8) .cse22)) .cse8))) (let ((.cse13 (or .cse15 (and .cse16 .cse3 .cse5 .cse6 .cse8) .cse17))) (or (and .cse13 .cse14) (and .cse13 .cse11) (and .cse0 .cse1 (or .cse15 (and .cse16 .cse3 .cse5 .cse6 .cse7 .cse8) .cse17))))) .cse34) (and .cse35 (let ((.cse40 (or (and .cse35 .cse55 .cse52 .cse8) (and .cse56 .cse35 .cse52 .cse8) (and .cse50 .cse35 .cse52 .cse53 .cse54 .cse8))) (.cse43 (or (and .cse35 .cse55 .cse8) (and .cse56 .cse35 .cse8) (and .cse50 .cse35 .cse54 .cse8)))) (let ((.cse37 (and (let ((.cse49 (or (and .cse56 .cse27 .cse35 .cse8) (and .cse50 .cse51 .cse27 .cse35 .cse54 .cse8) (and .cse27 .cse35 .cse55 .cse8)))) (let ((.cse46 (or (and .cse50 .cse51 .cse27 .cse35 .cse52 .cse53 .cse54 .cse8) (and .cse27 .cse35 .cse55 .cse52 .cse8) (and .cse56 .cse27 .cse35 .cse52 .cse8))) (.cse47 (and .cse27 .cse21 .cse31 .cse49 .cse8)) (.cse48 (and .cse27 .cse49 .cse8))) (or (and .cse27 .cse46 .cse8) (and .cse27 .cse21 .cse31 .cse46 .cse8) .cse47 (and (or .cse47 .cse48) .cse23) .cse48))) .cse8)) (.cse39 (and .cse18 (let ((.cse44 (and .cse43 .cse18 .cse21 .cse8)) (.cse45 (and .cse43 .cse18 .cse8))) (or (and .cse18 .cse21 .cse40 .cse8) .cse44 (and .cse18 .cse40 .cse8) (and .cse23 (or .cse44 .cse45)) .cse45)) .cse8)) (.cse38 (let ((.cse41 (and .cse43 .cse21 .cse8)) (.cse42 (and .cse43 .cse8))) (or (and .cse40 .cse8) (and .cse23 (or .cse41 .cse42)) (and .cse21 .cse40 .cse8) .cse41 .cse42)))) (let ((.cse36 (or .cse37 .cse39 (and .cse5 .cse6 .cse38 .cse8)))) (or (and .cse36 .cse14) (and .cse36 .cse11) (and .cse0 (or .cse37 (and .cse5 .cse6 .cse38 .cse7 .cse8) .cse39) .cse1)))))) (and (or .cse57 .cse11 .cse14) .cse58) (and .cse12 (let ((.cse69 (and .cse76 .cse27 .cse29 .cse75)) (.cse71 (and .cse76 .cse27 .cse31 .cse29 .cse75))) (let ((.cse60 (and .cse74 .cse27 .cse29 .cse75)) (.cse64 (and .cse23 (or .cse69 .cse71))) (.cse70 (and .cse74 .cse27 .cse31 .cse29 .cse75))) (let ((.cse59 (or .cse60 .cse61 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse73 .cse71 .cse72))) (or (and .cse59 .cse14) (and .cse0 (or .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72) .cse1) (and .cse59 .cse11))))) .cse34 .cse77) (and .cse35 .cse34 (let ((.cse79 (and .cse27 .cse94)) (.cse90 (and .cse27 .cse31 .cse94))) (let ((.cse82 (and .cse23 (or .cse79 .cse90))) (.cse87 (and .cse27 .cse93)) (.cse88 (and .cse27 .cse93 .cse31))) (let ((.cse78 (or .cse79 .cse80 .cse81 .cse92 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse88 .cse89 .cse90))) (or (and .cse78 .cse14) (and .cse78 .cse11) (and .cse0 .cse1 (or .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse88 .cse89 .cse90 .cse91))))))) (and .cse35 .cse95 (let ((.cse96 (and .cse27 .cse31 .cse112 .cse75)) (.cse103 (and .cse27 .cse112 .cse75))) (let ((.cse97 (and .cse27 .cse111 .cse75)) (.cse100 (and .cse27 .cse31 .cse111 .cse75)) (.cse107 (and .cse23 (or .cse96 .cse103)))) (let ((.cse109 (or .cse96 .cse97 .cse98 .cse110 .cse99 .cse100 .cse101 .cse102 .cse103 .cse104 .cse105 .cse107 .cse108))) (or (and (or .cse96 .cse97 .cse98 .cse99 .cse100 .cse101 .cse102 .cse103 .cse104 .cse105 .cse106 .cse107 .cse108) .cse0 .cse1) (and .cse14 .cse109) (and .cse11 .cse109)))))) (and .cse58 (let ((.cse113 (let ((.cse125 (and .cse120 .cse21 .cse8)) (.cse126 (and .cse120 .cse8))) (or (and .cse117 .cse8) .cse125 (and .cse117 .cse21 .cse8) .cse126 (and .cse23 (or .cse125 .cse126))))) (.cse114 (and (let ((.cse122 (and .cse27 .cse21 .cse31 .cse124 .cse8)) (.cse123 (and .cse27 .cse124 .cse8))) (or (and .cse27 .cse121 .cse8) (and (or .cse122 .cse123) .cse23) .cse122 .cse123 (and .cse27 .cse21 .cse31 .cse121 .cse8))) .cse8)) (.cse115 (and .cse18 (let ((.cse118 (and .cse120 .cse18 .cse8)) (.cse119 (and .cse120 .cse18 .cse21 .cse8))) (or (and .cse117 .cse18 .cse21 .cse8) .cse118 .cse119 (and .cse23 (or .cse118 .cse119)) (and .cse117 .cse18 .cse8))) .cse8))) (let ((.cse116 (or (and .cse5 .cse113 .cse6 .cse8) .cse114 .cse115))) (or (and .cse0 .cse1 (or (and .cse5 .cse113 .cse6 .cse7 .cse8) .cse114 .cse115)) (and .cse116 .cse11) (and .cse116 .cse14))))) (and (let ((.cse127 (and (let ((.cse137 (and .cse27 .cse21 .cse31 .cse140 .cse8)) (.cse138 (and .cse27 .cse140 .cse8))) (or (and (or .cse137 .cse138) .cse23) .cse137 (and .cse139 .cse27 .cse8) (and .cse139 .cse27 .cse21 .cse31 .cse8) .cse138)) .cse8)) (.cse129 (and .cse18 (let ((.cse135 (and .cse134 .cse18 .cse21 .cse8)) (.cse136 (and .cse134 .cse18 .cse8))) (or (and .cse18 .cse21 .cse133 .cse8) .cse135 (and .cse18 .cse133 .cse8) (and .cse23 (or .cse135 .cse136)) .cse136)) .cse8)) (.cse128 (let ((.cse131 (and .cse134 .cse21 .cse8)) (.cse132 (and .cse134 .cse8))) (or (and .cse23 (or .cse131 .cse132)) (and .cse21 .cse133 .cse8) (and .cse133 .cse8) .cse131 .cse132)))) (let ((.cse130 (or .cse127 .cse129 (and .cse128 .cse5 .cse6 .cse8)))) (or (and .cse0 .cse1 (or .cse127 (and .cse128 .cse5 .cse6 .cse7 .cse8) .cse129)) (and .cse130 .cse14) (and .cse130 .cse11)))) .cse58) (and .cse141 .cse11) (and (let ((.cse145 (and .cse27 .cse31 .cse158 .cse75)) (.cse149 (and .cse27 .cse158 .cse75))) (let ((.cse151 (and .cse23 (or .cse145 .cse149))) (.cse152 (and .cse27 .cse75 .cse157)) (.cse154 (and .cse27 .cse31 .cse75 .cse157))) (let ((.cse142 (or .cse143 .cse144 .cse145 .cse146 .cse147 .cse148 .cse149 .cse150 .cse151 .cse156 .cse152 .cse154 .cse155))) (or (and .cse142 .cse11) (and .cse0 (or .cse143 .cse144 .cse145 .cse146 .cse147 .cse148 .cse149 .cse150 .cse151 .cse152 .cse153 .cse154 .cse155) .cse1) (and .cse142 .cse14))))) .cse35 .cse95) (and .cse35 (let ((.cse163 (and .cse27 .cse94 .cse75)) (.cse160 (and .cse27 .cse31 .cse94 .cse75))) (let ((.cse161 (and .cse23 (or .cse163 .cse160))) (.cse162 (and .cse27 .cse93 .cse75)) (.cse164 (and .cse27 .cse93 .cse31 .cse75))) (let ((.cse159 (or .cse80 .cse81 .cse92 .cse160 .cse161 .cse83 .cse84 .cse85 .cse86 .cse89 .cse162 .cse163 .cse164))) (or (and .cse159 .cse11) (and .cse159 .cse14) (and .cse0 .cse1 (or .cse80 .cse81 .cse160 .cse161 .cse83 .cse84 .cse85 .cse86 .cse89 .cse162 .cse163 .cse91 .cse164)))))) .cse34 .cse77 .cse95) (and .cse0 (or .cse165 .cse166 (and .cse3 .cse167 .cse5 .cse6 .cse7 .cse8)) .cse1) (and .cse58 .cse34 (let ((.cse169 (let ((.cse176 (and .cse21 .cse24 .cse8)) (.cse177 (and .cse24 .cse8))) (or .cse176 .cse177 (and .cse20 .cse21 .cse8) (and .cse20 .cse8) (and .cse23 (or .cse176 .cse177))))) (.cse170 (and (let ((.cse174 (and .cse27 .cse21 .cse31 .cse33 .cse8)) (.cse175 (and .cse27 .cse33 .cse8))) (or .cse174 (and .cse27 .cse21 .cse31 .cse28 .cse8) (and .cse23 (or .cse174 .cse175)) .cse175 (and .cse27 .cse28 .cse8))) .cse8)) (.cse171 (and .cse18 (let ((.cse172 (and .cse18 .cse21 .cse24 .cse8)) (.cse173 (and .cse18 .cse24 .cse8))) (or .cse172 (and .cse20 .cse18 .cse21 .cse8) (and .cse23 (or .cse172 .cse173)) .cse173 (and .cse20 .cse18 .cse8))) .cse8))) (let ((.cse168 (or (and .cse5 .cse6 .cse169 .cse8) .cse170 .cse171))) (or (and .cse168 .cse14) (and .cse168 .cse11) (and .cse0 (or (and .cse5 .cse6 .cse169 .cse7 .cse8) .cse170 .cse171) .cse1))))) .cse11 .cse14 (and .cse12 .cse34 (let ((.cse181 (and .cse76 .cse27 .cse31 .cse29)) (.cse182 (and .cse76 .cse27 .cse29))) (let ((.cse178 (and .cse23 (or .cse181 .cse182))) (.cse179 (and .cse74 .cse27 .cse29)) (.cse180 (and .cse74 .cse27 .cse31 .cse29))) (let ((.cse183 (or .cse178 .cse61 .cse179 .cse180 .cse181 .cse63 .cse65 .cse66 .cse67 .cse68 .cse73 .cse182 .cse72))) (or (and (or .cse178 .cse61 .cse62 .cse179 .cse180 .cse181 .cse63 .cse65 .cse66 .cse67 .cse68 .cse182 .cse72) .cse0 .cse1) (and .cse183 .cse14) (and .cse183 .cse11)))))) (and .cse10 .cse14) (and (let ((.cse195 (or (and .cse35 .cse55 .cse52 .cse34 .cse8) (and .cse56 .cse35 .cse52 .cse34 .cse8) (and .cse50 .cse35 .cse52 .cse34 .cse53 .cse54 .cse191 .cse8))) (.cse196 (or (and .cse35 .cse55 .cse34 .cse8) (and .cse56 .cse35 .cse34 .cse8) (and .cse50 .cse35 .cse34 .cse54 .cse191 .cse8)))) (let ((.cse186 (and (let ((.cse197 (and .cse18 .cse196 .cse8)) (.cse198 (and .cse18 .cse21 .cse196 .cse8))) (or .cse197 .cse198 (and .cse18 .cse195 .cse8) (and .cse23 (or .cse197 .cse198)) (and .cse18 .cse21 .cse195 .cse8))) .cse18 .cse8)) (.cse185 (let ((.cse193 (and .cse196 .cse8)) (.cse194 (and .cse21 .cse196 .cse8))) (or (and .cse23 (or .cse193 .cse194)) (and .cse195 .cse8) .cse193 .cse194 (and .cse21 .cse195 .cse8)))) (.cse187 (and (let ((.cse192 (or (and .cse50 .cse51 .cse27 .cse35 .cse34 .cse54 .cse191 .cse8) (and .cse27 .cse35 .cse55 .cse34 .cse8) (and .cse56 .cse27 .cse35 .cse34 .cse8)))) (let ((.cse188 (and .cse27 .cse8 .cse192)) (.cse189 (and .cse27 .cse21 .cse31 .cse8 .cse192)) (.cse190 (or (and .cse50 .cse51 .cse27 .cse35 .cse52 .cse34 .cse53 .cse54 .cse191 .cse8) (and .cse27 .cse35 .cse55 .cse52 .cse34 .cse8) (and .cse56 .cse27 .cse35 .cse52 .cse34 .cse8)))) (or .cse188 (and .cse23 (or .cse188 .cse189)) .cse189 (and .cse190 .cse27 .cse21 .cse31 .cse8) (and .cse190 .cse27 .cse8)))) .cse8))) (let ((.cse184 (or .cse186 (and .cse5 .cse185 .cse6 .cse8) .cse187))) (or (and .cse184 .cse14) (and .cse0 .cse1 (or (and .cse5 .cse185 .cse6 .cse7 .cse8) .cse186 .cse187)) (and .cse184 .cse11))))) .cse35 .cse34) (and (let ((.cse203 (or (and .cse50 .cse211 .cse212 .cse35 .cse52 .cse53 .cse54 .cse213 .cse8) (and .cse211 .cse56 .cse212 .cse35 .cse52 .cse213 .cse215 .cse8) (and .cse211 .cse212 .cse35 .cse55 .cse52 .cse213 .cse8))) (.cse206 (or (and .cse211 .cse56 .cse35 .cse213 .cse215 .cse8) (and .cse211 .cse35 .cse55 .cse213 .cse8) (and .cse50 .cse211 .cse35 .cse54 .cse213 .cse8)))) (let ((.cse201 (let ((.cse216 (and .cse206 .cse8)) (.cse217 (and .cse21 .cse206 .cse8))) (or .cse216 (and .cse203 .cse8) (and (or .cse216 .cse217) .cse23) .cse217 (and .cse203 .cse21 .cse8)))) (.cse200 (and (let ((.cse210 (or (and .cse211 .cse27 .cse35 .cse55 .cse213 .cse214 .cse8) (and .cse211 .cse56 .cse27 .cse35 .cse213 .cse215 .cse214 .cse8) (and .cse50 .cse211 .cse51 .cse27 .cse35 .cse54 .cse213 .cse214 .cse8)))) (let ((.cse207 (and .cse27 .cse210 .cse8)) (.cse209 (or (and .cse50 .cse211 .cse51 .cse212 .cse27 .cse35 .cse52 .cse53 .cse54 .cse213 .cse214 .cse8) (and .cse211 .cse212 .cse27 .cse35 .cse55 .cse52 .cse213 .cse214 .cse8) (and .cse211 .cse56 .cse212 .cse27 .cse35 .cse52 .cse213 .cse215 .cse214 .cse8))) (.cse208 (and .cse27 .cse21 .cse31 .cse210 .cse8))) (or (and .cse23 (or .cse207 .cse208)) (and .cse27 .cse8 .cse209) .cse207 (and .cse27 .cse21 .cse31 .cse8 .cse209) .cse208))) .cse8)) (.cse202 (and .cse18 .cse8 (let ((.cse204 (and .cse18 .cse206 .cse8)) (.cse205 (and .cse18 .cse21 .cse206 .cse8))) (or (and .cse203 .cse18 .cse8) (and (or .cse204 .cse205) .cse23) (and .cse203 .cse18 .cse21 .cse8) .cse204 .cse205))))) (let ((.cse199 (or (and .cse5 .cse6 .cse201 .cse8) .cse200 .cse202))) (or (and .cse199 .cse14) (and .cse0 (or .cse200 (and .cse5 .cse6 .cse7 .cse201 .cse8) .cse202) .cse1) (and .cse199 .cse11))))) .cse35) (and .cse35 (let ((.cse219 (and .cse27 .cse158)) (.cse220 (and .cse27 .cse31 .cse158))) (let ((.cse218 (and .cse27 .cse31 .cse157)) (.cse221 (and .cse27 .cse157)) (.cse222 (and .cse23 (or .cse219 .cse220)))) (let ((.cse223 (or .cse143 .cse144 .cse218 .cse146 .cse147 .cse148 .cse219 .cse150 .cse220 .cse156 .cse221 .cse222 .cse155))) (or (and .cse0 .cse1 (or .cse143 .cse144 .cse218 .cse146 .cse147 .cse148 .cse219 .cse150 .cse220 .cse221 .cse222 .cse153 .cse155)) (and .cse223 .cse14) (and .cse223 .cse11)))))) (and .cse58 .cse34 (let ((.cse225 (and .cse76 .cse27 .cse31)) (.cse229 (and .cse76 .cse27))) (let ((.cse226 (and (or .cse225 .cse229) .cse23)) (.cse227 (and .cse74 .cse27 .cse31)) (.cse228 (and .cse74 .cse27))) (let ((.cse224 (or .cse225 .cse61 .cse226 .cse63 .cse65 .cse66 .cse67 .cse68 .cse227 .cse73 .cse228 .cse72 .cse229))) (or (and .cse224 .cse11) (and .cse224 .cse14) (and .cse0 (or .cse225 .cse61 .cse226 .cse62 .cse63 .cse65 .cse66 .cse67 .cse68 .cse227 .cse228 .cse72 .cse229) .cse1)))))) (and .cse141 .cse14) (and (let ((.cse231 (and .cse76 .cse27 .cse75)) (.cse234 (and .cse76 .cse27 .cse31 .cse75))) (let ((.cse232 (and .cse74 .cse27 .cse75)) (.cse233 (and .cse23 (or .cse231 .cse234))) (.cse235 (and .cse74 .cse27 .cse31 .cse75))) (let ((.cse230 (or .cse61 .cse231 .cse232 .cse63 .cse65 .cse66 .cse67 .cse233 .cse68 .cse73 .cse234 .cse72 .cse235))) (or (and .cse230 .cse11) (and .cse230 .cse14) (and .cse0 (or .cse61 .cse62 .cse231 .cse232 .cse63 .cse65 .cse66 .cse67 .cse233 .cse68 .cse234 .cse72 .cse235) .cse1))))) .cse58 .cse34 .cse77) .cse57 (and (let ((.cse238 (and .cse27 .cse31 .cse112)) (.cse239 (and .cse27 .cse112))) (let ((.cse237 (and .cse27 .cse31 .cse111)) (.cse240 (and .cse23 (or .cse238 .cse239))) (.cse241 (and .cse27 .cse111))) (let ((.cse236 (or .cse237 .cse98 .cse110 .cse238 .cse99 .cse239 .cse240 .cse101 .cse102 .cse104 .cse105 .cse241 .cse108))) (or (and .cse11 .cse236) (and .cse0 .cse1 (or .cse237 .cse98 .cse238 .cse99 .cse239 .cse240 .cse101 .cse102 .cse104 .cse105 .cse241 .cse106 .cse108)) (and .cse236 .cse14))))) .cse35))))))))) (forall ((v_idx_555 Int) (v_idx_556 Int) (v_idx_553 Int) (v_idx_554 Int) (v_idx_557 Int) (v_idx_551 Int) (v_idx_552 Int)) (let ((.cse314 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse272 (+ c_ULTIMATE.start_main_p1 1)) (.cse276 (<= .cse314 c_ULTIMATE.start_main_p4))) (and (let ((.cse268 (select |c_#memory_int| v_idx_551))) (let ((.cse270 (<= .cse272 v_idx_551)) (.cse266 (<= 0 (* 2 .cse268))) (.cse269 (<= 0 .cse268)) (.cse271 (< v_idx_551 c_ULTIMATE.start_main_p1))) (let ((.cse265 (or .cse270 (and .cse266 .cse269) .cse271))) (or (and .cse265 (< v_idx_557 c_ULTIMATE.start_main_p4)) (and .cse265 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_557)) (let ((.cse267 (select |c_#memory_int| v_idx_557))) (and (or (and .cse266 (<= .cse267 .cse268) .cse269) .cse270 .cse271) (<= (* 2 .cse267) 0) (<= .cse267 0))))))) (let ((.cse313 (+ v_idx_553 3)) (.cse312 (+ v_idx_556 1)) (.cse311 (+ v_idx_554 2)) (.cse307 (+ c_ULTIMATE.start_main_p1 2))) (let ((.cse305 (<= (+ v_idx_555 1) v_idx_554)) (.cse302 (<= v_idx_556 v_idx_554)) (.cse298 (<= .cse307 v_idx_554)) (.cse310 (<= .cse311 v_idx_555)) (.cse300 (<= .cse312 v_idx_555)) (.cse299 (<= .cse314 v_idx_555)) (.cse308 (<= .cse313 v_idx_555)) (.cse306 (<= (+ v_idx_555 2) c_ULTIMATE.start_main_p4)) (.cse304 (= (select |c_#memory_int| v_idx_555) 0)) (.cse303 (<= c_ULTIMATE.start_main_p4 v_idx_556)) (.cse285 (<= .cse313 c_ULTIMATE.start_main_p4)) (.cse301 (<= .cse312 c_ULTIMATE.start_main_p4)) (.cse280 (<= .cse311 c_ULTIMATE.start_main_p4))) (let ((.cse295 (or (and .cse285 (or (and .cse285 .cse310 .cse299 .cse308 .cse276 .cse280) (and .cse285 .cse310 .cse299 .cse308 .cse276 .cse280 .cse303) (and .cse285 .cse310 .cse300 .cse299 .cse301 .cse308 .cse276 .cse280)) .cse276 .cse280) (and .cse285 (or (and .cse285 .cse276 .cse306 .cse280 .cse303) (and .cse285 .cse276 .cse306 .cse280) (and .cse285 .cse301 .cse276 .cse306 .cse280)) .cse276 .cse306 .cse280) (and .cse285 .cse304 (or (and .cse285 .cse276 .cse280) (and .cse285 .cse276 .cse280 .cse303) (and .cse285 .cse301 .cse276 .cse280)) .cse276 .cse280))) (.cse293 (or (and .cse285 (or (and .cse285 .cse276 .cse306 .cse303) (and .cse285 .cse301 .cse276 .cse306) (and .cse285 .cse276 .cse306)) .cse276 .cse306) (and (or (and .cse285 .cse276) (and .cse285 .cse276 .cse303) (and .cse285 .cse301 .cse276)) .cse285 .cse304 .cse276) (and .cse285 (or (and .cse285 .cse299 .cse308 .cse276) (and .cse285 .cse299 .cse308 .cse276 .cse303) (and .cse285 .cse300 .cse299 .cse301 .cse308 .cse276)) .cse276))) (.cse275 (or (and (or (and .cse276 .cse303) (and .cse301 .cse276) .cse276) .cse304 .cse276) (and (or (and .cse276 .cse306) (and .cse301 .cse276 .cse306) (and .cse276 .cse306 .cse303)) .cse276 .cse306) (and (or (and .cse299 .cse276 .cse303) (and .cse300 .cse299 .cse301 .cse276) (and .cse299 .cse276)) .cse276))) (.cse283 (<= (+ v_idx_554 1) v_idx_553)) (.cse281 (or (and (or (and .cse310 .cse299 .cse276 .cse280 .cse303) (and .cse310 .cse299 .cse276 .cse280) (and .cse310 .cse300 .cse299 .cse301 .cse276 .cse280)) .cse276 .cse280) (and .cse304 (or (and .cse276 .cse280) (and .cse301 .cse276 .cse280) (and .cse276 .cse280 .cse303)) .cse276 .cse280) (and (or (and .cse301 .cse276 .cse306 .cse280) (and .cse276 .cse306 .cse280) (and .cse276 .cse306 .cse280 .cse303)) .cse276 .cse306 .cse280))) (.cse287 (let ((.cse309 (<= (+ v_idx_553 2) v_idx_554))) (or (and (or (and .cse285 .cse299 .cse308 .cse309 .cse298 .cse276) (and .cse285 .cse299 .cse308 .cse309 .cse298 .cse276 .cse303) (and .cse285 .cse300 .cse299 .cse301 .cse308 .cse309 .cse302 .cse298 .cse276)) .cse285 .cse309 .cse298 .cse276) (and .cse285 .cse309 .cse298 (or (and .cse285 .cse309 .cse298 .cse276 .cse305 .cse306 .cse303) (and .cse285 .cse301 .cse309 .cse302 .cse298 .cse276 .cse305 .cse306) (and .cse285 .cse309 .cse298 .cse276 .cse305 .cse306)) .cse276 .cse305 .cse306) (and .cse285 .cse304 .cse309 .cse298 (or (and .cse285 .cse309 .cse298 .cse276 .cse303) (and .cse285 .cse301 .cse309 .cse302 .cse298 .cse276) (and .cse285 .cse309 .cse298 .cse276)) .cse276)))) (.cse278 (= (select |c_#memory_int| v_idx_553) 0)) (.cse273 (<= .cse307 v_idx_553)) (.cse288 (or (and .cse298 .cse276 (or (and .cse299 .cse298 .cse276) (and .cse300 .cse299 .cse301 .cse302 .cse298 .cse276) (and .cse299 .cse298 .cse276 .cse303))) (and .cse304 (or (and .cse298 .cse276 .cse303) (and .cse301 .cse302 .cse298 .cse276) (and .cse298 .cse276)) .cse298 .cse276) (and .cse298 .cse276 .cse305 .cse306 (or (and .cse298 .cse276 .cse305 .cse306) (and .cse298 .cse276 .cse305 .cse306 .cse303) (and .cse301 .cse302 .cse298 .cse276 .cse305 .cse306)))))) (let ((.cse284 (and .cse273 .cse288 .cse276)) (.cse289 (and .cse288 .cse278 .cse276)) (.cse290 (and .cse285 .cse287 .cse276)) (.cse286 (<= (+ v_idx_553 1) v_idx_552)) (.cse279 (<= v_idx_554 v_idx_552)) (.cse282 (and .cse283 .cse273 .cse276 .cse280 .cse281)) (.cse296 (and .cse278 .cse276 .cse280 .cse281)) (.cse292 (and .cse278 .cse275 .cse276)) (.cse277 (and .cse285 .cse276 .cse293)) (.cse294 (and .cse273 .cse275 .cse276)) (.cse291 (< v_idx_552 .cse272)) (.cse297 (and .cse285 .cse295 .cse276 .cse280)) (.cse274 (<= .cse272 v_idx_552))) (or (and .cse273 .cse274 .cse275 .cse276) .cse277 (and .cse278 .cse274 .cse276 .cse279 .cse280 .cse281) .cse282 (and .cse283 .cse273 .cse274 .cse276 .cse279 .cse280 .cse281) .cse284 (and .cse285 .cse286 .cse287 .cse274 .cse276) (and .cse288 .cse278 .cse274 .cse276) .cse289 (and (or .cse290 .cse284 .cse289) .cse291) .cse292 (and .cse285 .cse286 .cse274 .cse276 .cse293) .cse290 .cse294 (and .cse273 .cse288 .cse274 .cse276) (and .cse285 .cse286 .cse295 .cse274 .cse276 .cse279 .cse280) .cse296 (and .cse291 (or .cse282 .cse296 .cse297)) (and (or .cse292 .cse277 .cse294) .cse291) .cse297 (and .cse278 .cse274 .cse275 .cse276)))))) .cse276))))) is different from false [2019-01-20 10:40:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:32,097 INFO L93 Difference]: Finished difference Result 29 states and 60 transitions. [2019-01-20 10:40:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:40:32,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:40:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:32,098 INFO L225 Difference]: With dead ends: 29 [2019-01-20 10:40:32,098 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:40:32,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-01-20 10:40:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:40:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-01-20 10:40:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:40:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 47 transitions. [2019-01-20 10:40:32,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 47 transitions. Word has length 4 [2019-01-20 10:40:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:32,187 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 47 transitions. [2019-01-20 10:40:32,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:40:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 47 transitions. [2019-01-20 10:40:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:40:32,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:32,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:40:32,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-20 10:40:32,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:32,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:32,714 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:40:32,838 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-20 10:40:32,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:32,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:32,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:40:32,839 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-20 10:40:32,840 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:32,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:45,025 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:40:45,026 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:40:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:45,026 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:40:46,054 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-20 10:40:46,055 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:40:48,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_698 Int) (v_idx_699 Int) (v_idx_697 Int) (v_idx_700 Int) (v_idx_701 Int) (v_idx_695 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse2 (<= .cse17 c_ULTIMATE.start_main_p4)) (.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (<= .cse18 c_ULTIMATE.start_main_p4))) (and (let ((.cse14 (+ v_idx_700 1)) (.cse8 (<= (+ v_idx_699 1) v_idx_698)) (.cse1 (<= (+ v_idx_699 2) c_ULTIMATE.start_main_p4)) (.cse6 (<= .cse19 v_idx_698)) (.cse7 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_698)) (.cse4 (< v_idx_698 .cse19)) (.cse9 (<= .cse18 v_idx_699)) (.cse12 (<= .cse17 v_idx_699))) (let ((.cse11 (or (and .cse6 .cse7 .cse9 .cse12 .cse2 .cse3) (and .cse9 .cse4 .cse12 .cse2 .cse3) (and .cse9 .cse12 .cse2 .cse3))) (.cse15 (or (and .cse6 .cse7 .cse8 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (.cse10 (<= c_ULTIMATE.start_main_p4 v_idx_700)) (.cse5 (<= v_idx_700 v_idx_698)) (.cse0 (<= .cse14 c_ULTIMATE.start_main_p4))) (or (and .cse0 (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 .cse2 .cse3)) .cse2 .cse3) (and .cse9 .cse10 .cse11 .cse12 .cse2 .cse3) (let ((.cse13 (<= .cse14 v_idx_699))) (and .cse9 .cse0 (or (and .cse5 .cse6 .cse7 .cse9 .cse0 .cse12 .cse2 .cse13 .cse3) (and .cse9 .cse0 .cse12 .cse2 .cse13 .cse3) (and .cse9 .cse4 .cse0 .cse12 .cse2 .cse13 .cse3)) .cse12 .cse2 .cse13 .cse3)) (and .cse9 .cse11 .cse12 .cse2 .cse3) (and .cse15 .cse2 .cse3) (and .cse15 .cse10 .cse2 .cse3) (and (let ((.cse16 (or (and .cse6 .cse7 .cse2 .cse3) (and .cse2 .cse3) (and .cse4 .cse2 .cse3)))) (or (and .cse10 .cse16 .cse2 .cse3) (and .cse16 .cse2 .cse3) (and (or (and .cse4 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse7 .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse3)) .cse0 .cse2 .cse3))) (= (select |c_#memory_int| v_idx_699) 0))))) (<= .cse20 c_ULTIMATE.start_main_p2) .cse2 (let ((.cse24 (select |c_#memory_int| v_idx_697))) (let ((.cse26 (<= .cse19 v_idx_697)) (.cse27 (< v_idx_697 c_ULTIMATE.start_main_p2)) (.cse23 (<= .cse24 0)) (.cse25 (<= (* 2 .cse24) 0))) (let ((.cse21 (or .cse26 .cse27 (and .cse23 .cse25)))) (or (and .cse21 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_701)) (let ((.cse22 (select |c_#memory_int| v_idx_701))) (and (<= .cse22 0) (or (and .cse23 (<= (+ .cse24 .cse22) 0) .cse25) .cse26 .cse27) (<= (* 2 .cse22) 0))) (and (< v_idx_701 c_ULTIMATE.start_main_p4) .cse21))))) (or (< v_idx_695 c_ULTIMATE.start_main_p1) (<= .cse20 v_idx_695) (= (select |c_#memory_int| v_idx_695) 0)) .cse3)))) is different from false [2019-01-20 10:40:50,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_710 Int) (v_idx_711 Int) (v_idx_706 Int) (v_idx_707 Int) (v_idx_704 Int) (v_idx_708 Int) (v_idx_709 Int)) (let ((.cse43 (+ c_ULTIMATE.start_main_p1 1))) (and (let ((.cse42 (+ c_ULTIMATE.start_main_p1 3)) (.cse30 (+ c_ULTIMATE.start_main_p2 1)) (.cse41 (+ c_ULTIMATE.start_main_p2 2))) (let ((.cse31 (select |c_#memory_int| v_idx_710)) (.cse40 (<= (+ v_idx_709 1) v_idx_708)) (.cse8 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_707)) (.cse12 (<= .cse41 v_idx_708)) (.cse13 (<= .cse30 v_idx_707)) (.cse14 (<= .cse42 v_idx_708)) (.cse38 (<= (+ c_ULTIMATE.start_main_p2 3) v_idx_710)) (.cse39 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_710)) (.cse16 (<= .cse42 v_idx_709)) (.cse17 (<= .cse41 v_idx_709)) (.cse37 (<= (+ v_idx_710 1) v_idx_709)) (.cse26 (<= v_idx_711 v_idx_709)) (.cse32 (select |c_#memory_int| v_idx_706))) (let ((.cse22 (<= (* 2 .cse32) 0)) (.cse23 (<= .cse32 0)) (.cse27 (and .cse16 .cse17 .cse37 .cse26)) (.cse28 (and .cse16 .cse38 .cse17 (<= (+ v_idx_711 1) v_idx_710) .cse26 .cse39)) (.cse7 (< v_idx_707 .cse30)) (.cse9 (and .cse8 .cse12 .cse13 .cse14)) (.cse10 (and .cse8 .cse40 (<= v_idx_709 v_idx_707) .cse12 .cse13 .cse14)) (.cse5 (and .cse40 .cse12 .cse14)) (.cse6 (and .cse12 .cse14)) (.cse15 (and .cse16 .cse38 .cse17 .cse39)) (.cse18 (<= (* 2 .cse31) 0)) (.cse20 (<= .cse31 0)) (.cse21 (and .cse16 .cse17 .cse37))) (let ((.cse1 (let ((.cse36 (or .cse15 (and .cse16 .cse17 .cse18 .cse20) .cse21))) (let ((.cse35 (and .cse36 .cse12 .cse14))) (or (and (or .cse5 .cse6 .cse35) .cse7) (and .cse8 (or .cse9 .cse10 (and .cse8 .cse36 .cse12 .cse13 .cse14)) .cse13) .cse5 .cse6 .cse35)))) (.cse3 (let ((.cse33 (or .cse27 (and .cse16 .cse17 .cse18 .cse26 .cse20) .cse28))) (let ((.cse34 (and .cse33 .cse12 .cse14))) (or (and .cse8 (or .cse9 .cse10 (and .cse8 .cse33 .cse12 .cse13 .cse14)) .cse13) (and (or .cse34 .cse5 .cse6) .cse7) .cse34 .cse5 .cse6)))) (.cse19 (<= (+ .cse31 .cse32) 0)) (.cse0 (<= .cse30 v_idx_706)) (.cse2 (< v_idx_706 c_ULTIMATE.start_main_p2)) (.cse29 (and .cse22 .cse23))) (or (and .cse0 .cse1) .cse0 (and .cse1 .cse2) .cse2 (and .cse0 .cse3) (and (let ((.cse11 (or .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20) .cse21))) (let ((.cse4 (and .cse11 .cse12 .cse14))) (or .cse4 (and (or .cse4 .cse5 .cse6) .cse7) (and .cse8 (or .cse9 .cse10 (and .cse8 .cse11 .cse12 .cse13 .cse14)) .cse13) .cse5 .cse6))) .cse22 .cse23) (and .cse3 .cse2) (and .cse22 (let ((.cse24 (or (and .cse16 .cse17 .cse18 .cse26 .cse19 .cse20) .cse27 .cse28))) (let ((.cse25 (and .cse24 .cse12 .cse14))) (or (and .cse8 (or .cse9 .cse10 (and .cse8 .cse24 .cse12 .cse13 .cse14)) .cse13) (and (or .cse25 .cse5 .cse6) .cse7) .cse25 .cse5 .cse6))) .cse23) (and (or .cse0 .cse2 .cse29) (= (select |c_#memory_int| v_idx_708) 0)) .cse29))))) (<= .cse43 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_704) 0) (< v_idx_704 c_ULTIMATE.start_main_p1) (<= .cse43 v_idx_704))))) is different from false [2019-01-20 10:40:50,783 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:40:50,783 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:40:50,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:40:50,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-20 10:40:50,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:40:50,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:40:50,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:40:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-01-20 10:40:50,785 INFO L87 Difference]: Start difference. First operand 19 states and 47 transitions. Second operand 5 states. [2019-01-20 10:40:53,160 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_710 Int) (v_idx_711 Int) (v_idx_706 Int) (v_idx_707 Int) (v_idx_704 Int) (v_idx_708 Int) (v_idx_709 Int)) (let ((.cse43 (+ c_ULTIMATE.start_main_p1 1))) (and (let ((.cse42 (+ c_ULTIMATE.start_main_p1 3)) (.cse30 (+ c_ULTIMATE.start_main_p2 1)) (.cse41 (+ c_ULTIMATE.start_main_p2 2))) (let ((.cse31 (select |c_#memory_int| v_idx_710)) (.cse40 (<= (+ v_idx_709 1) v_idx_708)) (.cse8 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_707)) (.cse12 (<= .cse41 v_idx_708)) (.cse13 (<= .cse30 v_idx_707)) (.cse14 (<= .cse42 v_idx_708)) (.cse38 (<= (+ c_ULTIMATE.start_main_p2 3) v_idx_710)) (.cse39 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_710)) (.cse16 (<= .cse42 v_idx_709)) (.cse17 (<= .cse41 v_idx_709)) (.cse37 (<= (+ v_idx_710 1) v_idx_709)) (.cse26 (<= v_idx_711 v_idx_709)) (.cse32 (select |c_#memory_int| v_idx_706))) (let ((.cse22 (<= (* 2 .cse32) 0)) (.cse23 (<= .cse32 0)) (.cse27 (and .cse16 .cse17 .cse37 .cse26)) (.cse28 (and .cse16 .cse38 .cse17 (<= (+ v_idx_711 1) v_idx_710) .cse26 .cse39)) (.cse7 (< v_idx_707 .cse30)) (.cse9 (and .cse8 .cse12 .cse13 .cse14)) (.cse10 (and .cse8 .cse40 (<= v_idx_709 v_idx_707) .cse12 .cse13 .cse14)) (.cse5 (and .cse40 .cse12 .cse14)) (.cse6 (and .cse12 .cse14)) (.cse15 (and .cse16 .cse38 .cse17 .cse39)) (.cse18 (<= (* 2 .cse31) 0)) (.cse20 (<= .cse31 0)) (.cse21 (and .cse16 .cse17 .cse37))) (let ((.cse1 (let ((.cse36 (or .cse15 (and .cse16 .cse17 .cse18 .cse20) .cse21))) (let ((.cse35 (and .cse36 .cse12 .cse14))) (or (and (or .cse5 .cse6 .cse35) .cse7) (and .cse8 (or .cse9 .cse10 (and .cse8 .cse36 .cse12 .cse13 .cse14)) .cse13) .cse5 .cse6 .cse35)))) (.cse3 (let ((.cse33 (or .cse27 (and .cse16 .cse17 .cse18 .cse26 .cse20) .cse28))) (let ((.cse34 (and .cse33 .cse12 .cse14))) (or (and .cse8 (or .cse9 .cse10 (and .cse8 .cse33 .cse12 .cse13 .cse14)) .cse13) (and (or .cse34 .cse5 .cse6) .cse7) .cse34 .cse5 .cse6)))) (.cse19 (<= (+ .cse31 .cse32) 0)) (.cse0 (<= .cse30 v_idx_706)) (.cse2 (< v_idx_706 c_ULTIMATE.start_main_p2)) (.cse29 (and .cse22 .cse23))) (or (and .cse0 .cse1) .cse0 (and .cse1 .cse2) .cse2 (and .cse0 .cse3) (and (let ((.cse11 (or .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20) .cse21))) (let ((.cse4 (and .cse11 .cse12 .cse14))) (or .cse4 (and (or .cse4 .cse5 .cse6) .cse7) (and .cse8 (or .cse9 .cse10 (and .cse8 .cse11 .cse12 .cse13 .cse14)) .cse13) .cse5 .cse6))) .cse22 .cse23) (and .cse3 .cse2) (and .cse22 (let ((.cse24 (or (and .cse16 .cse17 .cse18 .cse26 .cse19 .cse20) .cse27 .cse28))) (let ((.cse25 (and .cse24 .cse12 .cse14))) (or (and .cse8 (or .cse9 .cse10 (and .cse8 .cse24 .cse12 .cse13 .cse14)) .cse13) (and (or .cse25 .cse5 .cse6) .cse7) .cse25 .cse5 .cse6))) .cse23) (and (or .cse0 .cse2 .cse29) (= (select |c_#memory_int| v_idx_708) 0)) .cse29))))) (<= .cse43 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_704) 0) (< v_idx_704 c_ULTIMATE.start_main_p1) (<= .cse43 v_idx_704))))) (forall ((v_idx_713 Int)) (or (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_713) (< v_idx_713 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_713) 0))) (forall ((v_idx_698 Int) (v_idx_699 Int) (v_idx_697 Int) (v_idx_700 Int) (v_idx_701 Int) (v_idx_695 Int)) (let ((.cse62 (+ c_ULTIMATE.start_main_p2 2)) (.cse61 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse46 (<= .cse61 c_ULTIMATE.start_main_p4)) (.cse63 (+ c_ULTIMATE.start_main_p2 1)) (.cse64 (+ c_ULTIMATE.start_main_p1 1)) (.cse47 (<= .cse62 c_ULTIMATE.start_main_p4))) (and (let ((.cse58 (+ v_idx_700 1)) (.cse52 (<= (+ v_idx_699 1) v_idx_698)) (.cse45 (<= (+ v_idx_699 2) c_ULTIMATE.start_main_p4)) (.cse50 (<= .cse63 v_idx_698)) (.cse51 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_698)) (.cse48 (< v_idx_698 .cse63)) (.cse53 (<= .cse62 v_idx_699)) (.cse56 (<= .cse61 v_idx_699))) (let ((.cse55 (or (and .cse50 .cse51 .cse53 .cse56 .cse46 .cse47) (and .cse53 .cse48 .cse56 .cse46 .cse47) (and .cse53 .cse56 .cse46 .cse47))) (.cse59 (or (and .cse50 .cse51 .cse52 .cse45 .cse46 .cse47) (and .cse45 .cse46 .cse47) (and .cse48 .cse45 .cse46 .cse47))) (.cse54 (<= c_ULTIMATE.start_main_p4 v_idx_700)) (.cse49 (<= v_idx_700 v_idx_698)) (.cse44 (<= .cse58 c_ULTIMATE.start_main_p4))) (or (and .cse44 (or (and .cse44 .cse45 .cse46 .cse47) (and .cse48 .cse44 .cse45 .cse46 .cse47) (and .cse49 .cse50 .cse51 .cse52 .cse44 .cse45 .cse46 .cse47)) .cse46 .cse47) (and .cse53 .cse54 .cse55 .cse56 .cse46 .cse47) (let ((.cse57 (<= .cse58 v_idx_699))) (and .cse53 .cse44 (or (and .cse49 .cse50 .cse51 .cse53 .cse44 .cse56 .cse46 .cse57 .cse47) (and .cse53 .cse44 .cse56 .cse46 .cse57 .cse47) (and .cse53 .cse48 .cse44 .cse56 .cse46 .cse57 .cse47)) .cse56 .cse46 .cse57 .cse47)) (and .cse53 .cse55 .cse56 .cse46 .cse47) (and .cse59 .cse46 .cse47) (and .cse59 .cse54 .cse46 .cse47) (and (let ((.cse60 (or (and .cse50 .cse51 .cse46 .cse47) (and .cse46 .cse47) (and .cse48 .cse46 .cse47)))) (or (and .cse54 .cse60 .cse46 .cse47) (and .cse60 .cse46 .cse47) (and (or (and .cse48 .cse44 .cse46 .cse47) (and .cse49 .cse50 .cse51 .cse44 .cse46 .cse47) (and .cse44 .cse46 .cse47)) .cse44 .cse46 .cse47))) (= (select |c_#memory_int| v_idx_699) 0))))) (<= .cse64 c_ULTIMATE.start_main_p2) .cse46 (let ((.cse68 (select |c_#memory_int| v_idx_697))) (let ((.cse70 (<= .cse63 v_idx_697)) (.cse71 (< v_idx_697 c_ULTIMATE.start_main_p2)) (.cse67 (<= .cse68 0)) (.cse69 (<= (* 2 .cse68) 0))) (let ((.cse65 (or .cse70 .cse71 (and .cse67 .cse69)))) (or (and .cse65 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_701)) (let ((.cse66 (select |c_#memory_int| v_idx_701))) (and (<= .cse66 0) (or (and .cse67 (<= (+ .cse68 .cse66) 0) .cse69) .cse70 .cse71) (<= (* 2 .cse66) 0))) (and (< v_idx_701 c_ULTIMATE.start_main_p4) .cse65))))) (or (< v_idx_695 c_ULTIMATE.start_main_p1) (<= .cse64 v_idx_695) (= (select |c_#memory_int| v_idx_695) 0)) .cse47))))) is different from false [2019-01-20 10:41:18,322 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-20 10:41:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:41:18,324 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 41 more [2019-01-20 10:41:18,327 INFO L168 Benchmark]: Toolchain (without parser) took 169345.52 ms. Allocated memory was 140.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 108.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 788.7 MB. Max. memory is 7.1 GB. [2019-01-20 10:41:18,329 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:41:18,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.91 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:41:18,330 INFO L168 Benchmark]: Boogie Preprocessor took 24.47 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:41:18,331 INFO L168 Benchmark]: RCFGBuilder took 325.23 ms. Allocated memory is still 140.5 MB. Free memory was 104.3 MB in the beginning and 93.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-01-20 10:41:18,333 INFO L168 Benchmark]: TraceAbstraction took 168933.56 ms. Allocated memory was 140.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 774.4 MB. Max. memory is 7.1 GB. [2019-01-20 10:41:18,343 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.91 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.47 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.23 ms. Allocated memory is still 140.5 MB. Free memory was 104.3 MB in the beginning and 93.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 168933.56 ms. Allocated memory was 140.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 774.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...