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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:27:35,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:27:35,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:27:35,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:27:35,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:27:35,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:27:35,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:27:35,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:27:35,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:27:35,698 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:27:35,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:27:35,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:27:35,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:27:35,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:27:35,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:27:35,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:27:35,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:27:35,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:27:35,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:27:35,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:27:35,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:27:35,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:27:35,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:27:35,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:27:35,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:27:35,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:27:35,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:27:35,728 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:27:35,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:27:35,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:27:35,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:27:35,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:27:35,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:27:35,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:27:35,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:27:35,732 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:27:35,735 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:27:35,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:27:35,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:27:35,757 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:27:35,757 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:27:35,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:27:35,757 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:27:35,757 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:27:35,758 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:27:35,758 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:27:35,758 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:27:35,758 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:27:35,758 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:27:35,758 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:27:35,759 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:27:35,759 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:27:35,759 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:27:35,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:27:35,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:27:35,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:27:35,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:27:35,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:27:35,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:27:35,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:27:35,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:27:35,767 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:27:35,767 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:27:35,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:27:35,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:27:35,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:27:35,768 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:27:35,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:27:35,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:27:35,768 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:27:35,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:27:35,769 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:27:35,769 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:27:35,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:27:35,769 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:27:35,769 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:27:35,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:27:35,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:27:35,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:27:35,831 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:27:35,831 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:27:35,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl [2018-12-03 17:27:35,832 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl' [2018-12-03 17:27:35,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:27:35,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:27:35,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:35,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:27:35,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:27:35,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:35,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:27:35,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:27:35,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:27:35,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/1) ... [2018-12-03 17:27:35,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:27:35,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:27:35,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:27:35,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:27:35,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (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 [2018-12-03 17:27:36,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:27:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:27:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:27:36,638 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:27:36,638 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:27:36,639 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:36 BoogieIcfgContainer [2018-12-03 17:27:36,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:27:36,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:27:36,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:27:36,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:27:36,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:35" (1/2) ... [2018-12-03 17:27:36,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625f2c95 and model type pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:27:36, skipping insertion in model container [2018-12-03 17:27:36,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:36" (2/2) ... [2018-12-03 17:27:36,647 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl [2018-12-03 17:27:36,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:27:36,668 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:27:36,688 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:27:36,732 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:27:36,732 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:27:36,732 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:27:36,732 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:27:36,733 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:27:36,733 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:27:36,733 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:27:36,733 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:27:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:27:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:36,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:36,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:36,771 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:36,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 17:27:36,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:37,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:27:37,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:37,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:37,026 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 17:27:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,071 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-12-03 17:27:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:37,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:27:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,084 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:27:37,084 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:27:37,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:27:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:27:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:27:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-03 17:27:37,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-12-03 17:27:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:37,131 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-03 17:27:37,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-12-03 17:27:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:37,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:37,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:37,133 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:37,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2078913255, now seen corresponding path program 1 times [2018-12-03 17:27:37,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:37,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:37,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:27:37,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:37,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:37,312 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-12-03 17:27:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,407 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2018-12-03 17:27:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:37,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:27:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,414 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:27:37,414 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:27:37,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:27:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 17:27:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:27:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-03 17:27:37,435 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 14 [2018-12-03 17:27:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:37,437 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-03 17:27:37,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-03 17:27:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:37,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:37,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:37,439 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:37,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2136171557, now seen corresponding path program 1 times [2018-12-03 17:27:37,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:37,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:37,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:27:37,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:37,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:37,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:27:37,587 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 4 states. [2018-12-03 17:27:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,736 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2018-12-03 17:27:37,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:27:37,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:27:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,738 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:27:37,738 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:27:37,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:27:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:27:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-12-03 17:27:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:27:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-12-03 17:27:37,753 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 14 [2018-12-03 17:27:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:37,754 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-12-03 17:27:37,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-12-03 17:27:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:37,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:37,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:37,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:37,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:37,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2136111975, now seen corresponding path program 1 times [2018-12-03 17:27:37,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:37,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:37,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:37,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:37,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:27:37,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:37,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:27:37,875 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 4 states. [2018-12-03 17:27:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,990 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2018-12-03 17:27:37,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:27:37,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:27:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,994 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:27:37,994 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:27:37,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:27:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:27:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2018-12-03 17:27:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:27:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-12-03 17:27:38,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 14 [2018-12-03 17:27:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:38,009 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-12-03 17:27:38,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-12-03 17:27:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:27:38,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:38,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:38,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:38,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1820747817, now seen corresponding path program 1 times [2018-12-03 17:27:38,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:38,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:38,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:38,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:38,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:38,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:27:38,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:38,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:38,121 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2018-12-03 17:27:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:38,180 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-12-03 17:27:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:38,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:27:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:38,187 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:27:38,187 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:27:38,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:27:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 17:27:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:27:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2018-12-03 17:27:38,213 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 14 [2018-12-03 17:27:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:38,213 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-12-03 17:27:38,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2018-12-03 17:27:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:27:38,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:38,217 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:38,217 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1361822969, now seen corresponding path program 1 times [2018-12-03 17:27:38,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:38,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:38,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:27:38,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:38,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:38,335 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 3 states. [2018-12-03 17:27:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:38,353 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2018-12-03 17:27:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:38,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:27:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:38,355 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:27:38,355 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:27:38,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:27:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:27:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:27:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2018-12-03 17:27:38,369 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 26 [2018-12-03 17:27:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:38,370 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2018-12-03 17:27:38,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-12-03 17:27:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:27:38,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:38,371 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:38,372 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:38,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash 552476343, now seen corresponding path program 1 times [2018-12-03 17:27:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:38,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:27:38,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:38,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:38,540 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:27:38,542 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 17:27:38,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:27:38,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:27:39,233 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:28:24,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:28:24,958 INFO L272 AbstractInterpreter]: Visited 20 different actions 750 times. Merged at 19 different actions 529 times. Widened at 18 different actions 442 times. Found 171 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 17:28:25,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:25,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:28:25,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:25,008 INFO L192 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 [2018-12-03 17:28:25,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:25,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:25,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:28:25,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:28:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2018-12-03 17:28:25,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:25,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:28:25,289 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 4 states. [2018-12-03 17:28:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:25,374 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2018-12-03 17:28:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:28:25,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-12-03 17:28:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:25,380 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:28:25,380 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:28:25,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:28:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:28:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:28:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:28:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-12-03 17:28:25,404 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 26 [2018-12-03 17:28:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:25,406 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-03 17:28:25,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-12-03 17:28:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:28:25,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:25,409 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:25,411 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:25,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1259098827, now seen corresponding path program 2 times [2018-12-03 17:28:25,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 17:28:25,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:25,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:25,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:25,538 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 3 states. [2018-12-03 17:28:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:25,574 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2018-12-03 17:28:25,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:25,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:28:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:25,576 INFO L225 Difference]: With dead ends: 217 [2018-12-03 17:28:25,576 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:28:25,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:28:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-12-03 17:28:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:28:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-12-03 17:28:25,593 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 50 [2018-12-03 17:28:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:25,594 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-12-03 17:28:25,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-12-03 17:28:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:28:25,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:25,595 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:25,596 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:25,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 766029753, now seen corresponding path program 3 times [2018-12-03 17:28:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:25,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:28:25,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:25,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:25,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:25,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:25,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:25,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:25,711 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 3 states. [2018-12-03 17:28:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:25,730 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-12-03 17:28:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:25,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:28:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:25,732 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:28:25,732 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:28:25,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:28:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:28:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:28:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:28:25,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 17:28:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:25,734 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:28:25,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:28:25,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:28:25,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:28:25,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:26,046 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 17:28:26,441 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-12-03 17:28:26,586 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 17:28:26,882 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-03 17:28:27,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 313) no Hoare annotation was computed. [2018-12-03 17:28:27,057 INFO L444 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~mode3 1))) (or (and .cse0 (<= 512 ~mode2)) (and .cse1 .cse2 (<= ~r1 1) .cse3 (= ~mode1 0)) (and .cse1 (= ~mode2 0) .cse3) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~c1~85) .cse2 .cse3 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-12-03 17:28:27,058 INFO L444 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (let ((.cse0 (<= ~mode3 1)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~78))) (or (and (<= ~r1 0) (<= ~mode2 1) .cse0 .cse1) (and (= ~mode2 0) .cse0 .cse1))) [2018-12-03 17:28:27,058 INFO L444 ceAbstractionStarter]: At program point L310(lines 191 310) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~mode3 1)) (.cse2 (<= ~r1 0))) (or (and .cse0 (= ~mode2 0) .cse1) (and .cse2 .cse0 (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode2 1) .cse1 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (<= 1 ULTIMATE.start_check_~tmp~78)) (and .cse2 (<= 512 ~mode2) (= ~mode1 0)))) [2018-12-03 17:28:27,058 INFO L444 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (or (and (= ~mode2 0) (<= ~r1 1) (<= ~mode3 1)) (and (<= ~r1 0) (<= ~mode2 1))) [2018-12-03 17:28:27,058 INFO L444 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~mode3 1)) (.cse2 (not (= 0 |ULTIMATE.start_assert_#in~arg|)))) (or (and (<= ~r1 0) .cse0 (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode2 1) .cse1 .cse2 (<= 1 ULTIMATE.start_check_~tmp~78)) (and .cse0 (= ~mode2 0) .cse1 .cse2))) [2018-12-03 17:28:27,059 INFO L444 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (let ((.cse0 (<= ~mode3 1)) (.cse1 (not (= 0 |ULTIMATE.start_assert_#in~arg|)))) (or (and (= ~mode2 0) .cse0 .cse1) (and (<= ~r1 0) (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode2 1) .cse0 .cse1 (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-12-03 17:28:27,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-12-03 17:28:27,059 INFO L444 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~c1~85)) (.cse1 (<= ~mode3 1)) (.cse2 (<= 1 ULTIMATE.start_check_~tmp~78))) (or (and (<= ~r1 0) .cse0 (<= ~mode2 1) .cse1 .cse2) (and (= ~mode2 0) .cse0 .cse1 .cse2))) [2018-12-03 17:28:27,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 313) no Hoare annotation was computed. [2018-12-03 17:28:27,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 313) no Hoare annotation was computed. [2018-12-03 17:28:27,060 INFO L444 ceAbstractionStarter]: At program point L214(lines 204 215) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~mode3 1))) (or (and .cse0 (<= 512 ~mode2)) (and .cse1 .cse2 (<= ~r1 1) .cse3 (= ~mode1 0)) (and .cse1 (= ~mode2 0) .cse3) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~c1~85) .cse2 .cse3 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (<= 1 ULTIMATE.start_check_~tmp~78)))) [2018-12-03 17:28:27,060 INFO L444 ceAbstractionStarter]: At program point L243(lines 243 252) the Hoare annotation is: (or (and (= ~mode2 0) (<= ~r1 1) (<= ~mode3 1)) (and (<= ~r1 0) (<= ~mode2 1))) [2018-12-03 17:28:27,060 INFO L444 ceAbstractionStarter]: At program point L307(lines 307 311) the Hoare annotation is: false [2018-12-03 17:28:27,060 INFO L444 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (let ((.cse0 (<= ~mode3 1))) (or (and (= ~mode2 0) (<= ~r1 1) .cse0) (and (<= ~r1 0) (<= ~mode2 1) .cse0))) [2018-12-03 17:28:27,061 INFO L444 ceAbstractionStarter]: At program point L196(lines 196 205) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~mode3 1)) (.cse2 (<= ~r1 0))) (or (and .cse0 (= ~mode2 0) .cse1) (and .cse2 .cse0 (<= 1 ULTIMATE.start_main_~c1~85) (<= ~mode2 1) .cse1 (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (<= 1 ULTIMATE.start_check_~tmp~78)) (and .cse2 (<= 512 ~mode2) (= ~mode1 0)))) [2018-12-03 17:28:27,061 INFO L444 ceAbstractionStarter]: At program point L258(lines 251 259) the Hoare annotation is: (let ((.cse0 (<= ~mode3 1))) (or (and (= ~mode2 0) (<= ~r1 1) .cse0) (and (<= ~r1 0) (<= ~mode2 1) .cse0))) [2018-12-03 17:28:27,077 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:28:27 BoogieIcfgContainer [2018-12-03 17:28:27,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:28:27,078 INFO L168 Benchmark]: Toolchain (without parser) took 51184.64 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -193.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-12-03 17:28:27,080 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:28:27,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:28:27,081 INFO L168 Benchmark]: Boogie Preprocessor took 32.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:28:27,081 INFO L168 Benchmark]: RCFGBuilder took 669.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:28:27,082 INFO L168 Benchmark]: TraceAbstraction took 50437.61 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -225.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-12-03 17:28:27,089 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 669.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50437.61 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -225.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 512 <= ~mode2) || ((((!(0 == assert_~arg) && ~mode2 <= 1) && ~r1 <= 1) && ~mode3 <= 1) && ~mode1 == 0)) || ((!(0 == assert_~arg) && ~mode2 == 0) && ~mode3 <= 1)) || ((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && !(0 == assert_#in~arg)) && 1 <= check_~tmp~78) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && ~mode2 == 0) && ~mode3 <= 1) || ((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && !(0 == assert_#in~arg)) && 1 <= check_~tmp~78)) || ((~r1 <= 0 && 512 <= ~mode2) && ~mode1 == 0) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((~mode2 == 0 && ~r1 <= 1) && ~mode3 <= 1) || (~r1 <= 0 && ~mode2 <= 1) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((~mode2 == 0 && ~mode3 <= 1) && !(0 == assert_#in~arg)) || (((((~r1 <= 0 && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && !(0 == assert_#in~arg)) && 1 <= check_~tmp~78) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && 1 <= check_~tmp~78) || (((~mode2 == 0 && 1 <= main_~c1~85) && ~mode3 <= 1) && 1 <= check_~tmp~78) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 512 <= ~mode2) || ((((!(0 == assert_~arg) && ~mode2 <= 1) && ~r1 <= 1) && ~mode3 <= 1) && ~mode1 == 0)) || ((!(0 == assert_~arg) && ~mode2 == 0) && ~mode3 <= 1)) || ((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && !(0 == assert_#in~arg)) && 1 <= check_~tmp~78) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((~mode2 == 0 && ~r1 <= 1) && ~mode3 <= 1) || ((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((~mode2 == 0 && ~r1 <= 1) && ~mode3 <= 1) || (~r1 <= 0 && ~mode2 <= 1) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((~mode2 == 0 && ~r1 <= 1) && ~mode3 <= 1) || ((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && !(0 == assert_#in~arg)) && 1 <= check_~tmp~78) || (((!(0 == assert_~arg) && ~mode2 == 0) && ~mode3 <= 1) && !(0 == assert_#in~arg)) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && ~mode3 <= 1) && 1 <= check_~tmp~78) || ((~mode2 == 0 && ~mode3 <= 1) && 1 <= check_~tmp~78) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && ~mode2 == 0) && ~mode3 <= 1) || ((((((~r1 <= 0 && !(0 == assert_~arg)) && 1 <= main_~c1~85) && ~mode2 <= 1) && ~mode3 <= 1) && !(0 == assert_#in~arg)) && 1 <= check_~tmp~78)) || ((~r1 <= 0 && 512 <= ~mode2) && ~mode1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 50.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 137 SDslu, 182 SDs, 0 SdLazy, 47 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 83 NumberOfFragments, 417 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1495 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 14593 SizeOfPredicates, 1 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 174/192 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...