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-1ae3202 [2019-03-04 16:53:30,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:30,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:30,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:30,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:30,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:30,829 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:30,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:30,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:30,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:30,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:30,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:30,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:30,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:30,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:30,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:30,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:30,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:30,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:30,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:30,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:30,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:30,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:30,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:30,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:30,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:30,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:30,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:30,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:30,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:30,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:30,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:30,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:30,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:30,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:30,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:30,865 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-03-04 16:53:30,879 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:30,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:30,880 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:30,880 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:30,881 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:30,881 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:30,881 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:30,881 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:30,882 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:30,882 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:30,882 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:30,882 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:30,882 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:30,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:30,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:30,883 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:30,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:30,884 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:30,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:30,884 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:30,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:30,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:30,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:30,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:30,885 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:30,885 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:30,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:30,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:30,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:30,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:30,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:30,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:30,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:30,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:30,888 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:30,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:30,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:30,888 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:30,889 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:30,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:30,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:30,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:30,945 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:30,945 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:30,946 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-03-04 16:53:30,946 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-03-04 16:53:30,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:30,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:30,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:30,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:30,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:31,012 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,026 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:31,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:31,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:31,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:31,070 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,071 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,073 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,073 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,078 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,082 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,083 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 04.03 04:53:30" (1/1) ... [2019-03-04 16:53:31,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:31,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:31,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:31,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:31,094 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 04.03 04:53:30" (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-03-04 16:53:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:53:31,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:53:31,445 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:53:31,445 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-03-04 16:53:31,446 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:31 BoogieIcfgContainer [2019-03-04 16:53:31,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:31,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:31,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:31,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:31,451 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 04.03 04:53:30" (1/2) ... [2019-03-04 16:53:31,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a3e4f7 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:31, skipping insertion in model container [2019-03-04 16:53:31,452 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 04.03 04:53:31" (2/2) ... [2019-03-04 16:53:31,454 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-03-04 16:53:31,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:31,470 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-03-04 16:53:31,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-03-04 16:53:31,513 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:31,514 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:31,514 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:31,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:31,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:31,514 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:31,514 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:31,515 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-03-04 16:53:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:53:31,536 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:31,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:53:31,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:31,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-03-04 16:53:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:31,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:31,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:31,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:31,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:31,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:31,807 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-03-04 16:53:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:31,998 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-03-04 16:53:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:32,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:53:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:32,016 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:53:32,016 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:53:32,019 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-03-04 16:53:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:53:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-03-04 16:53:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:53:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-03-04 16:53:32,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-03-04 16:53:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:32,059 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-03-04 16:53:32,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-03-04 16:53:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:32,061 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:32,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:32,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-03-04 16:53:32,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:32,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:32,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:32,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:32,241 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:53:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:32,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:32,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:32,261 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-03-04 16:53:32,336 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:32,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:40,888 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:40,890 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-03-04 16:53:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:40,896 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:42,264 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-03-04 16:53:42,265 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:43,243 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:53:43,243 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-03-04 16:53:43,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:43,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:43,248 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2019-03-04 16:53:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:50,037 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2019-03-04 16:53:50,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:50,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:53:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:50,038 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:53:50,038 INFO L226 Difference]: Without dead ends: 15 [2019-03-04 16:53:50,040 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-03-04 16:53:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-03-04 16:53:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-03-04 16:53:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:53:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2019-03-04 16:53:50,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 3 [2019-03-04 16:53:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:50,049 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. [2019-03-04 16:53:50,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. [2019-03-04 16:53:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:50,050 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:50,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:50,052 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:50,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-03-04 16:53:50,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:50,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:50,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:50,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:50,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:50,126 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 3 states. [2019-03-04 16:53:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:50,309 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. [2019-03-04 16:53:50,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:50,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:50,311 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:53:50,311 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:53:50,312 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-03-04 16:53:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:53:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-03-04 16:53:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:53:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2019-03-04 16:53:50,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 3 [2019-03-04 16:53:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:50,319 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 26 transitions. [2019-03-04 16:53:50,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 26 transitions. [2019-03-04 16:53:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:50,320 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:50,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:50,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-03-04 16:53:50,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:50,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:50,378 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-03-04 16:53:50,380 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:50,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:55,714 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:55,715 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-03-04 16:53:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:55,715 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:57,749 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2019-03-04 16:53:57,750 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:59,110 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:53:59,111 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-03-04 16:53:59,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:59,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:59,112 INFO L87 Difference]: Start difference. First operand 14 states and 26 transitions. Second operand 3 states. [2019-03-04 16:53:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:59,371 INFO L93 Difference]: Finished difference Result 16 states and 32 transitions. [2019-03-04 16:53:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:59,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:59,372 INFO L225 Difference]: With dead ends: 16 [2019-03-04 16:53:59,372 INFO L226 Difference]: Without dead ends: 15 [2019-03-04 16:53:59,372 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-03-04 16:53:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-03-04 16:53:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-03-04 16:53:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-03-04 16:53:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2019-03-04 16:53:59,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 31 transitions. Word has length 3 [2019-03-04 16:53:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:59,379 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 31 transitions. [2019-03-04 16:53:59,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 31 transitions. [2019-03-04 16:53:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:59,380 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:59,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:59,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-03-04 16:53:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:59,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:59,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:59,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:59,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:59,458 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-03-04 16:53:59,463 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:59,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:04,578 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:04,578 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-03-04 16:54:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:04,578 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:05,413 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-03-04 16:54:05,414 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:06,132 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:54:06,132 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:06,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:06,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-03-04 16:54:06,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:06,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:06,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:54:06,134 INFO L87 Difference]: Start difference. First operand 15 states and 31 transitions. Second operand 4 states. [2019-03-04 16:54:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:06,611 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2019-03-04 16:54:06,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:54:06,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:54:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:06,612 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:54:06,612 INFO L226 Difference]: Without dead ends: 22 [2019-03-04 16:54:06,613 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-03-04 16:54:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-03-04 16:54:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-03-04 16:54:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:54:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-03-04 16:54:06,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-03-04 16:54:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:06,621 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-03-04 16:54:06,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-03-04 16:54:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:06,622 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:06,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:06,623 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-03-04 16:54:06,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:06,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:06,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:06,686 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-03-04 16:54:06,687 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:06,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:14,646 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:14,646 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-03-04 16:54:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:14,647 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:15,803 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-03-04 16:54:15,804 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:16,923 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:54:16,923 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:16,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:16,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-03-04 16:54:16,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:54:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:54:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:16,925 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 5 states. [2019-03-04 16:54:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:27,180 INFO L93 Difference]: Finished difference Result 24 states and 46 transitions. [2019-03-04 16:54:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:54:27,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:54:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:27,181 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:54:27,181 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:54:27,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:54:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:54:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-03-04 16:54:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:54:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-03-04 16:54:27,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 4 [2019-03-04 16:54:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:27,193 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-03-04 16:54:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:54:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-03-04 16:54:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:27,194 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:27,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:27,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-03-04 16:54:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:27,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:27,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:27,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:27,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:27,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:27,268 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-03-04 16:54:27,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:27,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:54:39,754 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:54:39,754 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:54:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:39,755 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:54:40,892 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 70.83% of their original sizes. [2019-03-04 16:54:40,893 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:54:43,270 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 ((.cse64 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse15 (<= .cse64 c_ULTIMATE.start_main_p4))) (and (let ((.cse5 (select |c_#memory_int| v_idx_557))) (let ((.cse4 (<= (* 2 .cse5) 0)) (.cse7 (<= .cse5 0)) (.cse2 (< v_idx_557 c_ULTIMATE.start_main_p4)) (.cse3 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_557))) (let ((.cse0 (or (and .cse4 .cse7) .cse2 .cse3))) (or (and .cse0 (< v_idx_551 c_ULTIMATE.start_main_p1)) (and (<= .cse1 v_idx_551) .cse0) (let ((.cse6 (select |c_#memory_int| v_idx_551))) (and (or .cse2 .cse3 (and .cse4 (<= .cse5 .cse6) .cse7)) (<= 0 (* 2 .cse6)) (<= 0 .cse6))))))) (let ((.cse65 (+ v_idx_556 1)) (.cse60 (+ c_ULTIMATE.start_main_p1 2)) (.cse66 (+ v_idx_554 2)) (.cse67 (+ v_idx_553 3))) (let ((.cse23 (<= .cse67 c_ULTIMATE.start_main_p4)) (.cse39 (<= .cse66 v_idx_555)) (.cse46 (<= .cse67 v_idx_555)) (.cse17 (<= .cse66 c_ULTIMATE.start_main_p4)) (.cse49 (<= v_idx_556 v_idx_554)) (.cse51 (<= (+ v_idx_555 1) v_idx_554)) (.cse50 (<= .cse60 v_idx_554)) (.cse38 (<= c_ULTIMATE.start_main_p4 v_idx_556)) (.cse40 (<= .cse65 v_idx_555)) (.cse33 (<= .cse65 c_ULTIMATE.start_main_p4)) (.cse42 (= (select |c_#memory_int| v_idx_555) 0)) (.cse41 (<= .cse64 v_idx_555)) (.cse34 (<= (+ v_idx_555 2) c_ULTIMATE.start_main_p4))) (let ((.cse20 (let ((.cse61 (and .cse15 .cse34)) (.cse62 (and .cse41 .cse15)) (.cse63 (and .cse42 .cse15))) (or (and .cse42 .cse33 .cse15) (and (or .cse61 .cse62 .cse63) .cse38) .cse61 (and .cse33 .cse15 .cse34) (and .cse40 .cse41 .cse33 .cse15) .cse62 .cse63))) (.cse18 (<= (+ v_idx_554 1) v_idx_553)) (.cse19 (<= .cse60 v_idx_553)) (.cse22 (let ((.cse57 (and .cse41 .cse50 .cse15)) (.cse58 (and .cse50 .cse15 .cse51 .cse34)) (.cse59 (and .cse42 .cse50 .cse15))) (or .cse57 (and .cse40 .cse41 .cse33 .cse49 .cse50 .cse15) (and .cse42 .cse33 .cse49 .cse50 .cse15) (and (or .cse57 .cse58 .cse59) .cse38) .cse58 .cse59 (and .cse33 .cse49 .cse50 .cse15 .cse51 .cse34)))) (.cse31 (let ((.cse54 (and .cse23 .cse39 .cse41 .cse46 .cse15 .cse17)) (.cse55 (and .cse23 .cse15 .cse34 .cse17)) (.cse56 (and .cse23 .cse42 .cse15 .cse17))) (or .cse54 (and (or .cse54 .cse55 .cse56) .cse38) .cse55 (and .cse23 .cse39 .cse40 .cse41 .cse33 .cse46 .cse15 .cse17) .cse56 (and .cse23 .cse33 .cse15 .cse34 .cse17) (and .cse23 .cse42 .cse33 .cse15 .cse17)))) (.cse32 (let ((.cse48 (<= (+ v_idx_553 2) v_idx_554))) (let ((.cse47 (and .cse23 .cse41 .cse46 .cse48 .cse50 .cse15)) (.cse52 (and .cse23 .cse42 .cse48 .cse50 .cse15)) (.cse53 (and .cse23 .cse48 .cse50 .cse15 .cse51 .cse34))) (or .cse47 (and .cse23 .cse42 .cse33 .cse48 .cse49 .cse50 .cse15) (and .cse23 .cse33 .cse48 .cse49 .cse50 .cse15 .cse51 .cse34) (and .cse23 .cse40 .cse41 .cse33 .cse46 .cse48 .cse49 .cse50 .cse15) (and (or .cse47 .cse52 .cse53) .cse38) .cse52 .cse53)))) (.cse25 (let ((.cse43 (and .cse23 .cse41 .cse46 .cse15)) (.cse44 (and .cse23 .cse42 .cse15)) (.cse45 (and .cse23 .cse15 .cse34))) (or .cse43 .cse44 (and (or .cse43 .cse44 .cse45) .cse38) (and .cse23 .cse40 .cse41 .cse33 .cse46 .cse15) (and .cse23 .cse33 .cse15 .cse34) .cse45 (and .cse23 .cse42 .cse33 .cse15)))) (.cse12 (let ((.cse35 (and .cse15 .cse34 .cse17)) (.cse36 (and .cse39 .cse41 .cse15 .cse17)) (.cse37 (and .cse42 .cse15 .cse17))) (or (and .cse33 .cse15 .cse34 .cse17) .cse35 (and (or .cse35 .cse36 .cse37) .cse38) .cse36 (and .cse39 .cse40 .cse41 .cse33 .cse15 .cse17) (and .cse42 .cse33 .cse15 .cse17) .cse37))) (.cse13 (= (select |c_#memory_int| v_idx_553) 0))) (let ((.cse11 (and .cse12 .cse13 .cse15 .cse17)) (.cse21 (and .cse23 .cse25 .cse15)) (.cse8 (< v_idx_552 .cse1)) (.cse28 (and .cse23 .cse15 .cse32)) (.cse9 (and .cse31 .cse23 .cse15 .cse17)) (.cse29 (and .cse13 .cse22 .cse15)) (.cse10 (and .cse18 .cse12 .cse19 .cse15 .cse17)) (.cse30 (and .cse19 .cse22 .cse15)) (.cse16 (<= v_idx_554 v_idx_552)) (.cse24 (<= (+ v_idx_553 1) v_idx_552)) (.cse26 (and .cse20 .cse19 .cse15)) (.cse27 (and .cse20 .cse13 .cse15)) (.cse14 (<= .cse1 v_idx_552))) (or (and .cse8 (or .cse9 .cse10 .cse11)) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse12 .cse19 .cse14 .cse15 .cse16 .cse17) (and .cse20 .cse13 .cse14 .cse15) .cse11 .cse21 (and .cse19 .cse22 .cse14 .cse15) (and .cse23 .cse24 .cse14 .cse25 .cse15) (and (or .cse26 .cse27 .cse21) .cse8) .cse28 (and .cse8 (or .cse28 .cse29 .cse30)) .cse9 .cse29 .cse10 .cse30 (and .cse31 .cse23 .cse24 .cse14 .cse15 .cse16 .cse17) (and .cse20 .cse19 .cse14 .cse15) (and .cse23 .cse24 .cse14 .cse15 .cse32) .cse26 .cse27 (and .cse13 .cse22 .cse14 .cse15)))))) .cse15)))) is different from false [2019-03-04 16:54:44,109 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:54:44,109 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:54:44,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:54:44,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-03-04 16:54:44,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:54:44,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:54:44,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:54:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-03-04 16:54:44,111 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 4 states. [2019-03-04 16:54:46,540 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse64 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse15 (<= .cse64 c_ULTIMATE.start_main_p4))) (and (let ((.cse5 (select |c_#memory_int| v_idx_557))) (let ((.cse4 (<= (* 2 .cse5) 0)) (.cse7 (<= .cse5 0)) (.cse2 (< v_idx_557 c_ULTIMATE.start_main_p4)) (.cse3 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_557))) (let ((.cse0 (or (and .cse4 .cse7) .cse2 .cse3))) (or (and .cse0 (< v_idx_551 c_ULTIMATE.start_main_p1)) (and (<= .cse1 v_idx_551) .cse0) (let ((.cse6 (select |c_#memory_int| v_idx_551))) (and (or .cse2 .cse3 (and .cse4 (<= .cse5 .cse6) .cse7)) (<= 0 (* 2 .cse6)) (<= 0 .cse6))))))) (let ((.cse65 (+ v_idx_556 1)) (.cse60 (+ c_ULTIMATE.start_main_p1 2)) (.cse66 (+ v_idx_554 2)) (.cse67 (+ v_idx_553 3))) (let ((.cse23 (<= .cse67 c_ULTIMATE.start_main_p4)) (.cse39 (<= .cse66 v_idx_555)) (.cse46 (<= .cse67 v_idx_555)) (.cse17 (<= .cse66 c_ULTIMATE.start_main_p4)) (.cse49 (<= v_idx_556 v_idx_554)) (.cse51 (<= (+ v_idx_555 1) v_idx_554)) (.cse50 (<= .cse60 v_idx_554)) (.cse38 (<= c_ULTIMATE.start_main_p4 v_idx_556)) (.cse40 (<= .cse65 v_idx_555)) (.cse33 (<= .cse65 c_ULTIMATE.start_main_p4)) (.cse42 (= (select |c_#memory_int| v_idx_555) 0)) (.cse41 (<= .cse64 v_idx_555)) (.cse34 (<= (+ v_idx_555 2) c_ULTIMATE.start_main_p4))) (let ((.cse20 (let ((.cse61 (and .cse15 .cse34)) (.cse62 (and .cse41 .cse15)) (.cse63 (and .cse42 .cse15))) (or (and .cse42 .cse33 .cse15) (and (or .cse61 .cse62 .cse63) .cse38) .cse61 (and .cse33 .cse15 .cse34) (and .cse40 .cse41 .cse33 .cse15) .cse62 .cse63))) (.cse18 (<= (+ v_idx_554 1) v_idx_553)) (.cse19 (<= .cse60 v_idx_553)) (.cse22 (let ((.cse57 (and .cse41 .cse50 .cse15)) (.cse58 (and .cse50 .cse15 .cse51 .cse34)) (.cse59 (and .cse42 .cse50 .cse15))) (or .cse57 (and .cse40 .cse41 .cse33 .cse49 .cse50 .cse15) (and .cse42 .cse33 .cse49 .cse50 .cse15) (and (or .cse57 .cse58 .cse59) .cse38) .cse58 .cse59 (and .cse33 .cse49 .cse50 .cse15 .cse51 .cse34)))) (.cse31 (let ((.cse54 (and .cse23 .cse39 .cse41 .cse46 .cse15 .cse17)) (.cse55 (and .cse23 .cse15 .cse34 .cse17)) (.cse56 (and .cse23 .cse42 .cse15 .cse17))) (or .cse54 (and (or .cse54 .cse55 .cse56) .cse38) .cse55 (and .cse23 .cse39 .cse40 .cse41 .cse33 .cse46 .cse15 .cse17) .cse56 (and .cse23 .cse33 .cse15 .cse34 .cse17) (and .cse23 .cse42 .cse33 .cse15 .cse17)))) (.cse32 (let ((.cse48 (<= (+ v_idx_553 2) v_idx_554))) (let ((.cse47 (and .cse23 .cse41 .cse46 .cse48 .cse50 .cse15)) (.cse52 (and .cse23 .cse42 .cse48 .cse50 .cse15)) (.cse53 (and .cse23 .cse48 .cse50 .cse15 .cse51 .cse34))) (or .cse47 (and .cse23 .cse42 .cse33 .cse48 .cse49 .cse50 .cse15) (and .cse23 .cse33 .cse48 .cse49 .cse50 .cse15 .cse51 .cse34) (and .cse23 .cse40 .cse41 .cse33 .cse46 .cse48 .cse49 .cse50 .cse15) (and (or .cse47 .cse52 .cse53) .cse38) .cse52 .cse53)))) (.cse25 (let ((.cse43 (and .cse23 .cse41 .cse46 .cse15)) (.cse44 (and .cse23 .cse42 .cse15)) (.cse45 (and .cse23 .cse15 .cse34))) (or .cse43 .cse44 (and (or .cse43 .cse44 .cse45) .cse38) (and .cse23 .cse40 .cse41 .cse33 .cse46 .cse15) (and .cse23 .cse33 .cse15 .cse34) .cse45 (and .cse23 .cse42 .cse33 .cse15)))) (.cse12 (let ((.cse35 (and .cse15 .cse34 .cse17)) (.cse36 (and .cse39 .cse41 .cse15 .cse17)) (.cse37 (and .cse42 .cse15 .cse17))) (or (and .cse33 .cse15 .cse34 .cse17) .cse35 (and (or .cse35 .cse36 .cse37) .cse38) .cse36 (and .cse39 .cse40 .cse41 .cse33 .cse15 .cse17) (and .cse42 .cse33 .cse15 .cse17) .cse37))) (.cse13 (= (select |c_#memory_int| v_idx_553) 0))) (let ((.cse11 (and .cse12 .cse13 .cse15 .cse17)) (.cse21 (and .cse23 .cse25 .cse15)) (.cse8 (< v_idx_552 .cse1)) (.cse28 (and .cse23 .cse15 .cse32)) (.cse9 (and .cse31 .cse23 .cse15 .cse17)) (.cse29 (and .cse13 .cse22 .cse15)) (.cse10 (and .cse18 .cse12 .cse19 .cse15 .cse17)) (.cse30 (and .cse19 .cse22 .cse15)) (.cse16 (<= v_idx_554 v_idx_552)) (.cse24 (<= (+ v_idx_553 1) v_idx_552)) (.cse26 (and .cse20 .cse19 .cse15)) (.cse27 (and .cse20 .cse13 .cse15)) (.cse14 (<= .cse1 v_idx_552))) (or (and .cse8 (or .cse9 .cse10 .cse11)) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse12 .cse19 .cse14 .cse15 .cse16 .cse17) (and .cse20 .cse13 .cse14 .cse15) .cse11 .cse21 (and .cse19 .cse22 .cse14 .cse15) (and .cse23 .cse24 .cse14 .cse25 .cse15) (and (or .cse26 .cse27 .cse21) .cse8) .cse28 (and .cse8 (or .cse28 .cse29 .cse30)) .cse9 .cse29 .cse10 .cse30 (and .cse31 .cse23 .cse24 .cse14 .cse15 .cse16 .cse17) (and .cse20 .cse19 .cse14 .cse15) (and .cse23 .cse24 .cse14 .cse15 .cse32) .cse26 .cse27 (and .cse13 .cse22 .cse14 .cse15)))))) .cse15)))) (forall ((v_idx_560 Int)) (or (let ((.cse68 (select |c_#memory_int| v_idx_560))) (and (<= 0 (* 2 .cse68)) (<= 0 .cse68))) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_560) (< v_idx_560 c_ULTIMATE.start_main_p1)))) is different from false [2019-03-04 16:54:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:58,539 INFO L93 Difference]: Finished difference Result 29 states and 60 transitions. [2019-03-04 16:54:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:54:58,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:54:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:58,541 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:54:58,541 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:54:58,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-03-04 16:54:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:54:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2019-03-04 16:54:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:54:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-03-04 16:54:58,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 4 [2019-03-04 16:54:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:58,555 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-03-04 16:54:58,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:54:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-03-04 16:54:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:54:58,556 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:58,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:54:58,556 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-03-04 16:54:58,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:58,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:58,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:58,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:58,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:58,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:58,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:54:58,688 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-03-04 16:54:58,689 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:54:58,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:10,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:55:10,051 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-03-04 16:55:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:10,051 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:55:10,782 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-03-04 16:55:10,782 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:55:13,146 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:55:13,147 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:55:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:55:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-03-04 16:55:13,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:13,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:55:13,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:55:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:55:13,148 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-03-04 16:55:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:23,610 INFO L93 Difference]: Finished difference Result 21 states and 53 transitions. [2019-03-04 16:55:23,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:23,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:55:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:23,611 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:55:23,611 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:55:23,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:55:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:55:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-03-04 16:55:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:55:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 47 transitions. [2019-03-04 16:55:23,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 47 transitions. Word has length 4 [2019-03-04 16:55:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:23,625 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 47 transitions. [2019-03-04 16:55:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:55:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 47 transitions. [2019-03-04 16:55:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:23,626 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:23,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:23,627 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash 943446, now seen corresponding path program 1 times [2019-03-04 16:55:23,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:23,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:23,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:23,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:55:23,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:23,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:55:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:55:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:55:23,659 INFO L87 Difference]: Start difference. First operand 19 states and 47 transitions. Second operand 3 states. [2019-03-04 16:55:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:23,695 INFO L93 Difference]: Finished difference Result 22 states and 49 transitions. [2019-03-04 16:55:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:23,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:55:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:23,696 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:55:23,696 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:55:23,697 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-03-04 16:55:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:55:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-03-04 16:55:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:55:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2019-03-04 16:55:23,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 46 transitions. Word has length 4 [2019-03-04 16:55:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:23,708 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 46 transitions. [2019-03-04 16:55:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:55:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 46 transitions. [2019-03-04 16:55:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:23,709 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:23,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:23,709 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 2 times [2019-03-04 16:55:23,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:23,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:23,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:23,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:23,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:23,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:23,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:23,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:23,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:23,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:23,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:55:23,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:23,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:23,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:55:23,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:23,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:55:23,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:23,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:55:23,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:55:23,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:55:23,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:23,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:55:23,992 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:24,003 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:24,011 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:24,021 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:24,040 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:24,041 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:55:24,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:55:24,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:24,113 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:24,114 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:55:24,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:24,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:55:24,210 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:24,226 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:24,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:55:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:24,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:24,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:24,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:24,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:24,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:24,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:24,346 INFO L87 Difference]: Start difference. First operand 19 states and 46 transitions. Second operand 8 states. [2019-03-04 16:55:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:24,858 INFO L93 Difference]: Finished difference Result 44 states and 83 transitions. [2019-03-04 16:55:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:55:24,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:24,860 INFO L225 Difference]: With dead ends: 44 [2019-03-04 16:55:24,861 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:55:24,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:55:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:55:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 21. [2019-03-04 16:55:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:55:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2019-03-04 16:55:24,878 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 56 transitions. Word has length 4 [2019-03-04 16:55:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:24,878 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 56 transitions. [2019-03-04 16:55:24,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 56 transitions. [2019-03-04 16:55:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:24,879 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:24,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:24,880 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-03-04 16:55:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:24,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:24,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:24,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:24,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:24,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:24,964 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-03-04 16:55:24,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:24,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:29,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:55:29,671 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:55:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:29,671 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:55:31,067 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2019-03-04 16:55:31,068 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:55:32,333 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:55:32,333 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:55:32,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:55:32,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-03-04 16:55:32,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:32,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:32,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:32,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:55:32,336 INFO L87 Difference]: Start difference. First operand 21 states and 56 transitions. Second operand 4 states. [2019-03-04 16:55:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:32,933 INFO L93 Difference]: Finished difference Result 30 states and 69 transitions. [2019-03-04 16:55:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:32,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:55:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:32,934 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:55:32,934 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:55:32,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:55:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:55:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-03-04 16:55:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:55:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2019-03-04 16:55:32,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 61 transitions. Word has length 4 [2019-03-04 16:55:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:32,948 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 61 transitions. [2019-03-04 16:55:32,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:55:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 61 transitions. [2019-03-04 16:55:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:32,949 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:32,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:32,949 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-03-04 16:55:32,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:32,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:32,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:33,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:33,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:33,027 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:33,027 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-03-04 16:55:33,028 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:33,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:43,569 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:55:43,570 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-03-04 16:55:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:43,570 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:55:45,825 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2019-03-04 16:55:45,825 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:55:49,130 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:55:49,130 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:55:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:55:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-03-04 16:55:49,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:49,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=5, Unknown=1, NotChecked=0, Total=12 [2019-03-04 16:55:49,131 INFO L87 Difference]: Start difference. First operand 22 states and 61 transitions. Second operand 4 states. [2019-03-04 16:56:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:00,362 INFO L93 Difference]: Finished difference Result 35 states and 90 transitions. [2019-03-04 16:56:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:56:00,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:56:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:00,363 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:56:00,364 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:56:00,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6, Invalid=5, Unknown=1, NotChecked=0, Total=12 [2019-03-04 16:56:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:56:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2019-03-04 16:56:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:56:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-03-04 16:56:00,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 4 [2019-03-04 16:56:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:00,409 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-03-04 16:56:00,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:56:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-03-04 16:56:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:00,410 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:00,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:00,411 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash 933646, now seen corresponding path program 2 times [2019-03-04 16:56:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:00,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:00,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:00,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:00,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:00,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:00,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:00,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:00,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:00,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:00,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:56:00,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:00,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:56:00,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:00,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-03-04 16:56:00,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:56:00,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:56:00,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,614 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:56:00,614 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,632 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,644 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,654 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,668 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:00,668 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:56:00,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:56:00,705 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,723 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:00,724 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:56:00,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:00,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:56:00,750 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,860 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:00,861 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:56:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:00,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:00,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:00,926 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-03-04 16:56:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:01,341 INFO L93 Difference]: Finished difference Result 48 states and 105 transitions. [2019-03-04 16:56:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:01,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:01,343 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:56:01,343 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:56:01,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:56:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 25. [2019-03-04 16:56:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:56:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 76 transitions. [2019-03-04 16:56:01,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 76 transitions. Word has length 4 [2019-03-04 16:56:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:01,376 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 76 transitions. [2019-03-04 16:56:01,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 76 transitions. [2019-03-04 16:56:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:01,377 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:01,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:01,377 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash 937490, now seen corresponding path program 1 times [2019-03-04 16:56:01,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:01,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:01,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:01,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:01,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:01,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:01,480 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-03-04 16:56:01,481 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:01,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:12,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:56:12,257 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-03-04 16:56:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:12,258 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:56:13,219 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-03-04 16:56:13,220 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:56:17,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1137 Int) (v_idx_1136 Int) (v_idx_1142 Int) (v_idx_1141 Int) (v_idx_1140 Int) (v_idx_1139 Int) (v_idx_1138 Int)) (let ((.cse61 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (<= .cse61 c_ULTIMATE.start_main_p4))) (and (or (< v_idx_1136 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_1136)) (<= .cse0 v_idx_1136)) (let ((.cse60 (+ v_idx_1138 3)) (.cse62 (+ c_ULTIMATE.start_main_p1 2)) (.cse63 (+ v_idx_1139 2)) (.cse55 (select |c_#memory_int| v_idx_1142))) (let ((.cse27 (<= (+ v_idx_1139 1) v_idx_1138)) (.cse50 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1142)) (.cse51 (< v_idx_1142 c_ULTIMATE.start_main_p4)) (.cse52 (<= .cse55 0)) (.cse54 (select |c_#memory_int| v_idx_1140)) (.cse53 (<= (* 2 .cse55) 0)) (.cse47 (<= v_idx_1139 v_idx_1137)) (.cse25 (<= .cse63 v_idx_1140)) (.cse24 (<= .cse63 c_ULTIMATE.start_main_p4)) (.cse5 (<= .cse62 v_idx_1138)) (.cse49 (< v_idx_1137 .cse0)) (.cse56 (<= .cse60 c_ULTIMATE.start_main_p4)) (.cse6 (<= .cse62 v_idx_1139)) (.cse59 (<= (+ v_idx_1138 2) v_idx_1139)) (.cse15 (<= .cse61 v_idx_1140)) (.cse57 (<= (+ v_idx_1138 1) v_idx_1137)) (.cse58 (<= .cse60 v_idx_1140)) (.cse48 (<= .cse0 v_idx_1137))) (let ((.cse46 (+ v_idx_1141 1)) (.cse42 (or (and .cse56 .cse49 .cse6 .cse59 .cse15 .cse58 .cse12) (and .cse56 .cse6 .cse59 .cse15 .cse58 .cse12) (and .cse56 .cse6 .cse59 .cse15 .cse57 .cse58 .cse12 .cse48))) (.cse43 (or (and .cse56 .cse6 .cse59 .cse12) (and .cse56 .cse49 .cse6 .cse59 .cse12) (and .cse56 .cse6 .cse59 .cse57 .cse12 .cse48))) (.cse29 (or (and .cse49 .cse6 .cse15 .cse12) (and .cse6 .cse15 .cse12) (and .cse6 .cse15 .cse12 .cse48))) (.cse28 (or (and .cse49 .cse6 .cse12) (and .cse6 .cse12) (and .cse6 .cse12 .cse48))) (.cse22 (or (and .cse5 .cse15 .cse12) (and .cse5 .cse15 .cse12 .cse48) (and .cse49 .cse5 .cse15 .cse12))) (.cse21 (or (and .cse5 .cse12) (and .cse49 .cse5 .cse12) (and .cse5 .cse12 .cse48))) (.cse33 (or (and .cse15 .cse12 .cse48) (and .cse15 .cse12) (and .cse49 .cse15 .cse12))) (.cse34 (or (and .cse49 .cse12) (and .cse12 .cse48) .cse12)) (.cse32 (or (and .cse56 .cse15 .cse57 .cse58 .cse12 .cse48) (and .cse56 .cse49 .cse15 .cse58 .cse12) (and .cse56 .cse15 .cse58 .cse12))) (.cse31 (or (and .cse56 .cse49 .cse12) (and .cse56 .cse12) (and .cse56 .cse57 .cse12 .cse48))) (.cse8 (<= (+ v_idx_1140 1) v_idx_1139)) (.cse10 (or (and .cse6 .cse5 .cse12) (and .cse49 .cse6 .cse5 .cse12) (and .cse6 .cse5 .cse12 .cse48))) (.cse14 (or (and .cse6 .cse5 .cse15 .cse12 .cse48) (and .cse49 .cse6 .cse5 .cse15 .cse12) (and .cse6 .cse5 .cse15 .cse12))) (.cse45 (or (and .cse56 .cse49 .cse15 .cse25 .cse58 .cse12 .cse24) (and .cse56 .cse47 .cse15 .cse57 .cse25 .cse58 .cse12 .cse48 .cse24) (and .cse56 .cse15 .cse25 .cse58 .cse12 .cse24))) (.cse44 (or (and .cse56 .cse47 .cse57 .cse12 .cse48 .cse24) (and .cse56 .cse49 .cse12 .cse24) (and .cse56 .cse12 .cse24))) (.cse36 (or (and .cse15 .cse25 .cse12 .cse24) (and .cse49 .cse15 .cse25 .cse12 .cse24) (and .cse47 .cse15 .cse25 .cse12 .cse48 .cse24))) (.cse35 (or (and .cse12 .cse24) (and .cse49 .cse12 .cse24) (and .cse47 .cse12 .cse48 .cse24))) (.cse30 (= 0 (select |c_#memory_int| v_idx_1138))) (.cse9 (<= (+ v_idx_1140 2) c_ULTIMATE.start_main_p4)) (.cse17 (or .cse50 .cse51 (and .cse52 (<= .cse55 .cse54) .cse53))) (.cse23 (or (and .cse49 .cse5 .cse12 .cse24 .cse27) (and .cse5 .cse12 .cse24 .cse27) (and .cse47 .cse5 .cse12 .cse48 .cse24 .cse27))) (.cse18 (<= 0 (* 2 .cse54))) (.cse19 (<= 0 .cse54)) (.cse7 (or .cse50 .cse51 (and .cse52 .cse53))) (.cse26 (or (and .cse47 .cse5 .cse15 .cse25 .cse12 .cse48 .cse24 .cse27) (and .cse5 .cse15 .cse25 .cse12 .cse24 .cse27) (and .cse49 .cse5 .cse15 .cse25 .cse12 .cse24 .cse27)))) (let ((.cse1 (and (or (and .cse7 .cse23 .cse9 .cse12 .cse24) (and .cse17 .cse23 .cse18 .cse12 .cse24 .cse19) (and .cse7 .cse15 .cse25 .cse12 .cse24 .cse26)) .cse5 .cse12 .cse24 .cse27)) (.cse2 (and (or (and .cse7 .cse36 .cse15 .cse25 .cse12 .cse24) (and .cse7 .cse9 .cse35 .cse12 .cse24) (and .cse17 .cse18 .cse35 .cse12 .cse24 .cse19)) .cse12 .cse30 .cse24)) (.cse3 (and .cse12 .cse24 (or (and .cse7 .cse45 .cse15 .cse25 .cse12 .cse24) (and .cse17 .cse44 .cse18 .cse12 .cse24 .cse19) (and .cse7 .cse9 .cse44 .cse12 .cse24)))) (.cse37 (and .cse5 .cse12 (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse17 .cse6 .cse10 .cse18 .cse12 .cse19) (and .cse6 .cse7 .cse14 .cse15 .cse12)))) (.cse20 (and .cse12 (or (and .cse7 .cse32 .cse15 .cse12) (and .cse17 .cse31 .cse18 .cse12 .cse19) (and .cse7 .cse31 .cse9 .cse12)))) (.cse38 (and (or (and .cse7 .cse15 .cse33 .cse12) (and .cse17 .cse34 .cse18 .cse12 .cse19) (and .cse7 .cse9 .cse34 .cse12)) .cse12 .cse30)) (.cse39 (and .cse5 (or (and .cse17 .cse21 .cse18 .cse12 .cse19) (and .cse7 .cse22 .cse15 .cse12) (and .cse7 .cse9 .cse21 .cse12)) .cse12)) (.cse4 (<= c_ULTIMATE.start_main_p4 v_idx_1141)) (.cse40 (and (or (and .cse17 .cse6 .cse28 .cse18 .cse12 .cse19) (and .cse6 .cse7 .cse29 .cse15 .cse12) (and .cse6 .cse7 .cse8 .cse9 .cse28 .cse12)) .cse12 .cse30)) (.cse13 (<= v_idx_1141 v_idx_1139)) (.cse41 (and (or (and .cse6 .cse7 .cse8 .cse9 .cse12 .cse43) (and .cse6 .cse7 .cse15 .cse42 .cse12) (and .cse17 .cse6 .cse18 .cse12 .cse19 .cse43)) .cse12)) (.cse11 (<= .cse46 c_ULTIMATE.start_main_p4)) (.cse16 (<= .cse46 v_idx_1140))) (or (and (or .cse1 .cse2 .cse3) .cse4) (and .cse5 (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse6 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19)) .cse12) .cse1 .cse20 (and .cse5 .cse12 (or (and .cse7 .cse9 .cse21 .cse11 .cse12) (and .cse7 .cse22 .cse15 .cse11 .cse16 .cse12) (and .cse17 .cse21 .cse11 .cse18 .cse12 .cse19))) (and .cse5 (or (and .cse7 .cse23 .cse9 .cse11 .cse12 .cse24) (and .cse7 .cse15 .cse11 .cse16 .cse25 .cse12 .cse24 .cse26) (and .cse17 .cse23 .cse11 .cse18 .cse12 .cse24 .cse19)) .cse12 .cse24 .cse27) (and (or (and .cse17 .cse6 .cse28 .cse11 .cse18 .cse12 .cse13 .cse19) (and .cse6 .cse7 .cse8 .cse9 .cse28 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse29 .cse15 .cse11 .cse16 .cse12 .cse13)) .cse12 .cse30) (and (or (and .cse17 .cse31 .cse11 .cse18 .cse12 .cse19) (and .cse7 .cse32 .cse15 .cse11 .cse16 .cse12) (and .cse7 .cse31 .cse9 .cse11 .cse12)) .cse12) (and (or (and .cse7 .cse15 .cse11 .cse33 .cse16 .cse12) (and .cse7 .cse9 .cse34 .cse11 .cse12) (and .cse17 .cse34 .cse11 .cse18 .cse12 .cse19)) .cse12 .cse30) .cse2 (and (or (and .cse17 .cse11 .cse18 .cse35 .cse12 .cse24 .cse19) (and .cse7 .cse9 .cse11 .cse35 .cse12 .cse24) (and .cse7 .cse36 .cse15 .cse11 .cse16 .cse25 .cse12 .cse24)) .cse12 .cse30 .cse24) .cse37 .cse38 .cse3 .cse39 (and (or .cse37 .cse40 .cse41) .cse4) (and (or .cse20 .cse38 .cse39) .cse4) .cse40 (and (or (and .cse6 .cse7 .cse15 .cse11 .cse42 .cse16 .cse12 .cse13) (and .cse17 .cse6 .cse11 .cse18 .cse12 .cse13 .cse19 .cse43) (and .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse43)) .cse12) .cse41 (and (or (and .cse17 .cse44 .cse11 .cse18 .cse12 .cse24 .cse19) (and .cse7 .cse9 .cse44 .cse11 .cse12 .cse24) (and .cse7 .cse45 .cse15 .cse11 .cse16 .cse25 .cse12 .cse24)) .cse12 .cse24)))))) .cse12)))) is different from false [2019-03-04 16:56:17,692 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:56:17,692 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:56:17,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:56:17,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-03-04 16:56:17,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:56:17,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:56:17,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:56:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=7, Unknown=1, NotChecked=4, Total=20 [2019-03-04 16:56:17,694 INFO L87 Difference]: Start difference. First operand 25 states and 76 transitions. Second operand 5 states. [2019-03-04 16:56:19,852 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1137 Int) (v_idx_1136 Int) (v_idx_1142 Int) (v_idx_1141 Int) (v_idx_1140 Int) (v_idx_1139 Int) (v_idx_1138 Int)) (let ((.cse61 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (<= .cse61 c_ULTIMATE.start_main_p4))) (and (or (< v_idx_1136 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_1136)) (<= .cse0 v_idx_1136)) (let ((.cse60 (+ v_idx_1138 3)) (.cse62 (+ c_ULTIMATE.start_main_p1 2)) (.cse63 (+ v_idx_1139 2)) (.cse55 (select |c_#memory_int| v_idx_1142))) (let ((.cse27 (<= (+ v_idx_1139 1) v_idx_1138)) (.cse50 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1142)) (.cse51 (< v_idx_1142 c_ULTIMATE.start_main_p4)) (.cse52 (<= .cse55 0)) (.cse54 (select |c_#memory_int| v_idx_1140)) (.cse53 (<= (* 2 .cse55) 0)) (.cse47 (<= v_idx_1139 v_idx_1137)) (.cse25 (<= .cse63 v_idx_1140)) (.cse24 (<= .cse63 c_ULTIMATE.start_main_p4)) (.cse5 (<= .cse62 v_idx_1138)) (.cse49 (< v_idx_1137 .cse0)) (.cse56 (<= .cse60 c_ULTIMATE.start_main_p4)) (.cse6 (<= .cse62 v_idx_1139)) (.cse59 (<= (+ v_idx_1138 2) v_idx_1139)) (.cse15 (<= .cse61 v_idx_1140)) (.cse57 (<= (+ v_idx_1138 1) v_idx_1137)) (.cse58 (<= .cse60 v_idx_1140)) (.cse48 (<= .cse0 v_idx_1137))) (let ((.cse46 (+ v_idx_1141 1)) (.cse42 (or (and .cse56 .cse49 .cse6 .cse59 .cse15 .cse58 .cse12) (and .cse56 .cse6 .cse59 .cse15 .cse58 .cse12) (and .cse56 .cse6 .cse59 .cse15 .cse57 .cse58 .cse12 .cse48))) (.cse43 (or (and .cse56 .cse6 .cse59 .cse12) (and .cse56 .cse49 .cse6 .cse59 .cse12) (and .cse56 .cse6 .cse59 .cse57 .cse12 .cse48))) (.cse29 (or (and .cse49 .cse6 .cse15 .cse12) (and .cse6 .cse15 .cse12) (and .cse6 .cse15 .cse12 .cse48))) (.cse28 (or (and .cse49 .cse6 .cse12) (and .cse6 .cse12) (and .cse6 .cse12 .cse48))) (.cse22 (or (and .cse5 .cse15 .cse12) (and .cse5 .cse15 .cse12 .cse48) (and .cse49 .cse5 .cse15 .cse12))) (.cse21 (or (and .cse5 .cse12) (and .cse49 .cse5 .cse12) (and .cse5 .cse12 .cse48))) (.cse33 (or (and .cse15 .cse12 .cse48) (and .cse15 .cse12) (and .cse49 .cse15 .cse12))) (.cse34 (or (and .cse49 .cse12) (and .cse12 .cse48) .cse12)) (.cse32 (or (and .cse56 .cse15 .cse57 .cse58 .cse12 .cse48) (and .cse56 .cse49 .cse15 .cse58 .cse12) (and .cse56 .cse15 .cse58 .cse12))) (.cse31 (or (and .cse56 .cse49 .cse12) (and .cse56 .cse12) (and .cse56 .cse57 .cse12 .cse48))) (.cse8 (<= (+ v_idx_1140 1) v_idx_1139)) (.cse10 (or (and .cse6 .cse5 .cse12) (and .cse49 .cse6 .cse5 .cse12) (and .cse6 .cse5 .cse12 .cse48))) (.cse14 (or (and .cse6 .cse5 .cse15 .cse12 .cse48) (and .cse49 .cse6 .cse5 .cse15 .cse12) (and .cse6 .cse5 .cse15 .cse12))) (.cse45 (or (and .cse56 .cse49 .cse15 .cse25 .cse58 .cse12 .cse24) (and .cse56 .cse47 .cse15 .cse57 .cse25 .cse58 .cse12 .cse48 .cse24) (and .cse56 .cse15 .cse25 .cse58 .cse12 .cse24))) (.cse44 (or (and .cse56 .cse47 .cse57 .cse12 .cse48 .cse24) (and .cse56 .cse49 .cse12 .cse24) (and .cse56 .cse12 .cse24))) (.cse36 (or (and .cse15 .cse25 .cse12 .cse24) (and .cse49 .cse15 .cse25 .cse12 .cse24) (and .cse47 .cse15 .cse25 .cse12 .cse48 .cse24))) (.cse35 (or (and .cse12 .cse24) (and .cse49 .cse12 .cse24) (and .cse47 .cse12 .cse48 .cse24))) (.cse30 (= 0 (select |c_#memory_int| v_idx_1138))) (.cse9 (<= (+ v_idx_1140 2) c_ULTIMATE.start_main_p4)) (.cse17 (or .cse50 .cse51 (and .cse52 (<= .cse55 .cse54) .cse53))) (.cse23 (or (and .cse49 .cse5 .cse12 .cse24 .cse27) (and .cse5 .cse12 .cse24 .cse27) (and .cse47 .cse5 .cse12 .cse48 .cse24 .cse27))) (.cse18 (<= 0 (* 2 .cse54))) (.cse19 (<= 0 .cse54)) (.cse7 (or .cse50 .cse51 (and .cse52 .cse53))) (.cse26 (or (and .cse47 .cse5 .cse15 .cse25 .cse12 .cse48 .cse24 .cse27) (and .cse5 .cse15 .cse25 .cse12 .cse24 .cse27) (and .cse49 .cse5 .cse15 .cse25 .cse12 .cse24 .cse27)))) (let ((.cse1 (and (or (and .cse7 .cse23 .cse9 .cse12 .cse24) (and .cse17 .cse23 .cse18 .cse12 .cse24 .cse19) (and .cse7 .cse15 .cse25 .cse12 .cse24 .cse26)) .cse5 .cse12 .cse24 .cse27)) (.cse2 (and (or (and .cse7 .cse36 .cse15 .cse25 .cse12 .cse24) (and .cse7 .cse9 .cse35 .cse12 .cse24) (and .cse17 .cse18 .cse35 .cse12 .cse24 .cse19)) .cse12 .cse30 .cse24)) (.cse3 (and .cse12 .cse24 (or (and .cse7 .cse45 .cse15 .cse25 .cse12 .cse24) (and .cse17 .cse44 .cse18 .cse12 .cse24 .cse19) (and .cse7 .cse9 .cse44 .cse12 .cse24)))) (.cse37 (and .cse5 .cse12 (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse17 .cse6 .cse10 .cse18 .cse12 .cse19) (and .cse6 .cse7 .cse14 .cse15 .cse12)))) (.cse20 (and .cse12 (or (and .cse7 .cse32 .cse15 .cse12) (and .cse17 .cse31 .cse18 .cse12 .cse19) (and .cse7 .cse31 .cse9 .cse12)))) (.cse38 (and (or (and .cse7 .cse15 .cse33 .cse12) (and .cse17 .cse34 .cse18 .cse12 .cse19) (and .cse7 .cse9 .cse34 .cse12)) .cse12 .cse30)) (.cse39 (and .cse5 (or (and .cse17 .cse21 .cse18 .cse12 .cse19) (and .cse7 .cse22 .cse15 .cse12) (and .cse7 .cse9 .cse21 .cse12)) .cse12)) (.cse4 (<= c_ULTIMATE.start_main_p4 v_idx_1141)) (.cse40 (and (or (and .cse17 .cse6 .cse28 .cse18 .cse12 .cse19) (and .cse6 .cse7 .cse29 .cse15 .cse12) (and .cse6 .cse7 .cse8 .cse9 .cse28 .cse12)) .cse12 .cse30)) (.cse13 (<= v_idx_1141 v_idx_1139)) (.cse41 (and (or (and .cse6 .cse7 .cse8 .cse9 .cse12 .cse43) (and .cse6 .cse7 .cse15 .cse42 .cse12) (and .cse17 .cse6 .cse18 .cse12 .cse19 .cse43)) .cse12)) (.cse11 (<= .cse46 c_ULTIMATE.start_main_p4)) (.cse16 (<= .cse46 v_idx_1140))) (or (and (or .cse1 .cse2 .cse3) .cse4) (and .cse5 (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13) (and .cse17 .cse6 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19)) .cse12) .cse1 .cse20 (and .cse5 .cse12 (or (and .cse7 .cse9 .cse21 .cse11 .cse12) (and .cse7 .cse22 .cse15 .cse11 .cse16 .cse12) (and .cse17 .cse21 .cse11 .cse18 .cse12 .cse19))) (and .cse5 (or (and .cse7 .cse23 .cse9 .cse11 .cse12 .cse24) (and .cse7 .cse15 .cse11 .cse16 .cse25 .cse12 .cse24 .cse26) (and .cse17 .cse23 .cse11 .cse18 .cse12 .cse24 .cse19)) .cse12 .cse24 .cse27) (and (or (and .cse17 .cse6 .cse28 .cse11 .cse18 .cse12 .cse13 .cse19) (and .cse6 .cse7 .cse8 .cse9 .cse28 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse29 .cse15 .cse11 .cse16 .cse12 .cse13)) .cse12 .cse30) (and (or (and .cse17 .cse31 .cse11 .cse18 .cse12 .cse19) (and .cse7 .cse32 .cse15 .cse11 .cse16 .cse12) (and .cse7 .cse31 .cse9 .cse11 .cse12)) .cse12) (and (or (and .cse7 .cse15 .cse11 .cse33 .cse16 .cse12) (and .cse7 .cse9 .cse34 .cse11 .cse12) (and .cse17 .cse34 .cse11 .cse18 .cse12 .cse19)) .cse12 .cse30) .cse2 (and (or (and .cse17 .cse11 .cse18 .cse35 .cse12 .cse24 .cse19) (and .cse7 .cse9 .cse11 .cse35 .cse12 .cse24) (and .cse7 .cse36 .cse15 .cse11 .cse16 .cse25 .cse12 .cse24)) .cse12 .cse30 .cse24) .cse37 .cse38 .cse3 .cse39 (and (or .cse37 .cse40 .cse41) .cse4) (and (or .cse20 .cse38 .cse39) .cse4) .cse40 (and (or (and .cse6 .cse7 .cse15 .cse11 .cse42 .cse16 .cse12 .cse13) (and .cse17 .cse6 .cse11 .cse18 .cse12 .cse13 .cse19 .cse43) (and .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse43)) .cse12) .cse41 (and (or (and .cse17 .cse44 .cse11 .cse18 .cse12 .cse24 .cse19) (and .cse7 .cse9 .cse44 .cse11 .cse12 .cse24) (and .cse7 .cse45 .cse15 .cse11 .cse16 .cse25 .cse12 .cse24)) .cse12 .cse24)))))) .cse12)))) (forall ((v_idx_1133 Int) (v_idx_1131 Int) (v_idx_1130 Int) (v_idx_1129 Int) (v_idx_1128 Int) (v_idx_1127 Int)) (let ((.cse90 (+ c_ULTIMATE.start_main_p1 2))) (let ((.cse64 (<= .cse90 c_ULTIMATE.start_main_p3)) (.cse66 (+ c_ULTIMATE.start_main_p1 1)) (.cse65 (+ c_ULTIMATE.start_main_p3 1)) (.cse80 (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4))) (and .cse64 (<= .cse65 c_ULTIMATE.start_main_p4) (or (< v_idx_1127 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_1127)) (<= .cse66 v_idx_1127)) (let ((.cse89 (+ v_idx_1130 1)) (.cse86 (<= (+ v_idx_1129 2) c_ULTIMATE.start_main_p3)) (.cse87 (<= (+ v_idx_1129 3) c_ULTIMATE.start_main_p4)) (.cse84 (<= .cse90 v_idx_1129)) (.cse77 (= (select |c_#memory_int| v_idx_1129) 0))) (let ((.cse73 (< v_idx_1128 .cse66)) (.cse83 (and .cse64 .cse77 .cse80)) (.cse67 (and .cse84 .cse64 .cse80)) (.cse82 (and .cse86 .cse64 .cse87 .cse80)) (.cse76 (<= .cse66 v_idx_1128)) (.cse88 (<= (+ v_idx_1129 1) v_idx_1128)) (.cse79 (<= (+ v_idx_1130 2) c_ULTIMATE.start_main_p4)) (.cse85 (<= .cse89 v_idx_1129)) (.cse81 (<= .cse89 c_ULTIMATE.start_main_p3))) (let ((.cse70 (and .cse84 .cse64 .cse79 .cse85 .cse80 .cse81)) (.cse68 (and .cse86 .cse64 .cse76 .cse87 .cse88 .cse80)) (.cse69 (and .cse73 (or .cse83 .cse67 .cse82))) (.cse71 (and .cse84 .cse64 .cse76 .cse80)) (.cse72 (and .cse64 .cse76 .cse77 .cse80)) (.cse78 (<= v_idx_1130 v_idx_1128)) (.cse74 (and .cse64 .cse77 .cse79 .cse80 .cse81)) (.cse75 (and .cse86 .cse64 .cse87 .cse79 .cse80 .cse81))) (or .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 (and .cse73 (or .cse70 .cse74 .cse75)) (and .cse64 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81) .cse82 .cse83 (and .cse84 .cse64 .cse76 .cse78 .cse79 .cse85 .cse80 .cse81) (and (or .cse83 .cse67 .cse68 .cse69 .cse71 .cse72 .cse82) (<= c_ULTIMATE.start_main_p3 v_idx_1130)) (and .cse86 .cse64 .cse76 .cse87 .cse88 .cse78 .cse79 .cse80 .cse81) .cse74 .cse75)))) (let ((.cse94 (select |c_#memory_int| v_idx_1133))) (let ((.cse92 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1133)) (.cse93 (<= .cse94 0)) (.cse95 (<= (* 2 .cse94) 0)) (.cse96 (< v_idx_1133 c_ULTIMATE.start_main_p4))) (let ((.cse97 (or .cse92 (and .cse93 .cse95) .cse96))) (or (let ((.cse91 (select |c_#memory_int| v_idx_1131))) (and (<= 0 .cse91) (or .cse92 (and .cse93 (<= .cse94 .cse91) .cse95) .cse96) (<= 0 (* 2 .cse91)))) (and .cse97 (<= .cse65 v_idx_1131)) (and (< v_idx_1131 c_ULTIMATE.start_main_p3) .cse97))))) .cse80))))) is different from false [2019-03-04 16:56:27,849 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:56:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:56:27,851 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-03-04 16:56:27,856 INFO L168 Benchmark]: Toolchain (without parser) took 176863.05 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 108.5 MB in the beginning and 820.2 MB in the end (delta: -711.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-03-04 16:56:27,857 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:56:27,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.15 ms. Allocated memory is still 141.0 MB. Free memory was 108.3 MB in the beginning and 106.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:27,861 INFO L168 Benchmark]: Boogie Preprocessor took 34.55 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:27,863 INFO L168 Benchmark]: RCFGBuilder took 353.53 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:27,863 INFO L168 Benchmark]: TraceAbstraction took 176407.66 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 94.4 MB in the beginning and 820.2 MB in the end (delta: -725.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-03-04 16:56:27,873 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 141.0 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.15 ms. Allocated memory is still 141.0 MB. Free memory was 108.3 MB in the beginning and 106.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.55 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.53 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176407.66 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 94.4 MB in the beginning and 820.2 MB in the end (delta: -725.9 MB). Peak memory consumption was 1.9 GB. 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...