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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:53:37,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:53:37,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:53:37,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:53:37,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:53:37,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:53:37,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:53:37,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:53:37,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:53:37,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:53:37,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:53:37,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:53:37,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:53:37,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:53:37,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:53:37,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:53:37,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:53:37,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:53:37,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:53:37,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:53:37,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:53:37,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:53:37,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:53:37,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:53:37,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:53:37,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:53:37,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:53:37,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:53:37,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:53:37,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:53:37,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:53:37,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:53:37,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:53:37,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:53:37,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:53:37,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:53:37,623 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:53:37,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:53:37,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:53:37,638 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:53:37,638 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:53:37,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:53:37,639 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:53:37,639 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:53:37,639 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:53:37,639 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:53:37,639 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:53:37,640 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:53:37,640 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:53:37,640 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:53:37,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:53:37,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:53:37,641 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:53:37,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:53:37,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:53:37,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:53:37,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:53:37,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:53:37,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:53:37,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:53:37,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:53:37,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:53:37,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:53:37,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:53:37,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:53:37,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:53:37,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:53:37,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:53:37,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:53:37,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:53:37,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:53:37,645 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:53:37,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:53:37,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:53:37,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:53:37,645 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:53:37,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:53:37,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:53:37,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:53:37,696 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:53:37,696 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:53:37,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 17:53:37,697 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl' [2018-12-03 17:53:37,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:53:37,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:53:37,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:53:37,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:53:37,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:53:37,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:53:37,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:53:37,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:53:37,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:53:37,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/1) ... [2018-12-03 17:53:37,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:53:37,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:53:37,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:53:37,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:53:37,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (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:53:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:53:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:53:38,381 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:53:38,382 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:53:38,382 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:53:38 BoogieIcfgContainer [2018-12-03 17:53:38,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:53:38,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:53:38,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:53:38,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:53:38,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:37" (1/2) ... [2018-12-03 17:53:38,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1e469a and model type pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:53:38, skipping insertion in model container [2018-12-03 17:53:38,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:53:38" (2/2) ... [2018-12-03 17:53:38,390 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 17:53:38,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:53:38,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:53:38,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:53:38,458 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:53:38,459 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:53:38,459 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:53:38,459 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:53:38,459 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:53:38,459 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:53:38,460 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:53:38,460 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:53:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-03 17:53:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:53:38,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:38,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:38,486 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:38,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-12-03 17:53:38,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:38,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:38,740 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:53:38,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:38,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:38,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:38,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:38,764 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-12-03 17:53:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:38,828 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-12-03 17:53:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:38,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 17:53:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:38,842 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:53:38,842 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:53:38,847 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:53:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:53:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-03 17:53:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:53:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-12-03 17:53:38,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-12-03 17:53:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:38,888 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-12-03 17:53:38,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-12-03 17:53:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:53:38,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:38,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:38,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:38,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash -100955755, now seen corresponding path program 1 times [2018-12-03 17:53:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:38,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:38,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:39,146 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:53:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:39,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:53:39,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:39,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:53:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:53:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:53:39,150 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-12-03 17:53:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:39,340 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-12-03 17:53:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:53:39,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-03 17:53:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:39,344 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:53:39,344 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:53:39,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:53:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:53:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-12-03 17:53:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:53:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-12-03 17:53:39,366 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-12-03 17:53:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:39,367 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-03 17:53:39,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:53:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-12-03 17:53:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:53:39,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:39,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:39,369 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:39,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash -493923183, now seen corresponding path program 1 times [2018-12-03 17:53:39,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:39,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:39,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:39,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:39,460 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:53:39,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:39,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:39,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:39,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:39,462 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-12-03 17:53:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:39,516 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-12-03 17:53:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:39,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 17:53:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:39,518 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:53:39,518 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:53:39,519 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:53:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:53:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-03 17:53:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:53:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-03 17:53:39,531 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 12 [2018-12-03 17:53:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:39,532 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-03 17:53:39,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-03 17:53:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:53:39,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:39,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:39,533 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:39,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1628792711, now seen corresponding path program 1 times [2018-12-03 17:53:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:39,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:39,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:39,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:39,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:39,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:39,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:39,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:39,687 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 3 states. [2018-12-03 17:53:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:39,745 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2018-12-03 17:53:39,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:39,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 17:53:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:39,748 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:53:39,748 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:53:39,749 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:53:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:53:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-03 17:53:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:53:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-12-03 17:53:39,771 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 22 [2018-12-03 17:53:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:39,771 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-12-03 17:53:39,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-12-03 17:53:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:53:39,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:39,773 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:39,773 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:39,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash -819446085, now seen corresponding path program 1 times [2018-12-03 17:53:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:39,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:39,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:39,990 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:53:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:39,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:39,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:39,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:39,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:39,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:39,995 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-12-03 17:53:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:40,065 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-12-03 17:53:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:40,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 17:53:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:40,069 INFO L225 Difference]: With dead ends: 213 [2018-12-03 17:53:40,070 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 17:53:40,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 17:53:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-12-03 17:53:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 17:53:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-12-03 17:53:40,104 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-12-03 17:53:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:40,105 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-12-03 17:53:40,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-12-03 17:53:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:53:40,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:40,107 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:40,107 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:40,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash -762187783, now seen corresponding path program 1 times [2018-12-03 17:53:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:40,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:40,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:40,325 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-03 17:53:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:40,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:40,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:53:40,381 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 17:53:40,383 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42] [2018-12-03 17:53:40,443 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:53:40,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:53:41,054 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:53:49,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:53:49,558 INFO L272 AbstractInterpreter]: Visited 17 different actions 107 times. Merged at 16 different actions 69 times. Widened at 4 different actions 12 times. Found 21 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:53:49,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:49,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:53:49,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:49,582 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:53:49,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:49,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:53:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:49,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:53:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:53:49,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:53:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:53:50,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:53:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 17:53:50,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:53:50,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:53:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:53:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:53:50,099 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-12-03 17:53:50,803 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 17:53:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:51,438 INFO L93 Difference]: Finished difference Result 311 states and 390 transitions. [2018-12-03 17:53:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:53:51,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-03 17:53:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:51,441 INFO L225 Difference]: With dead ends: 311 [2018-12-03 17:53:51,441 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 17:53:51,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:53:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 17:53:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 177. [2018-12-03 17:53:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 17:53:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 212 transitions. [2018-12-03 17:53:51,492 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 212 transitions. Word has length 22 [2018-12-03 17:53:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:51,497 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 212 transitions. [2018-12-03 17:53:51,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:53:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 212 transitions. [2018-12-03 17:53:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:53:51,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:51,499 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:53:51,500 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:51,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash 518092167, now seen corresponding path program 2 times [2018-12-03 17:53:51,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:51,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:51,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:51,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-03 17:53:51,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:51,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:51,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:51,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:51,581 INFO L87 Difference]: Start difference. First operand 177 states and 212 transitions. Second operand 3 states. [2018-12-03 17:53:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:51,631 INFO L93 Difference]: Finished difference Result 325 states and 390 transitions. [2018-12-03 17:53:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:51,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 17:53:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:51,633 INFO L225 Difference]: With dead ends: 325 [2018-12-03 17:53:51,633 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 17:53:51,634 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:53:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 17:53:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2018-12-03 17:53:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 17:53:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-12-03 17:53:51,666 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 42 [2018-12-03 17:53:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:51,666 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-12-03 17:53:51,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-12-03 17:53:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:53:51,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:51,668 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:53:51,669 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:51,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1324768879, now seen corresponding path program 3 times [2018-12-03 17:53:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:51,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:53:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:51,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:52,015 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:53:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-03 17:53:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:52,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:52,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:52,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:52,022 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 3 states. [2018-12-03 17:53:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:52,045 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-12-03 17:53:52,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:52,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 17:53:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:52,046 INFO L225 Difference]: With dead ends: 151 [2018-12-03 17:53:52,046 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:53:52,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:53:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:53:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:53:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:53:52,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-12-03 17:53:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:52,050 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:53:52,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:53:52,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:53:52,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:53:52,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:53:52,492 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 17:53:52,700 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 17:53:52,827 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-03 17:53:53,013 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 309) no Hoare annotation was computed. [2018-12-03 17:53:53,014 INFO L444 ceAbstractionStarter]: At program point L287(lines 282 288) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= 1 ULTIMATE.start_check_~tmp~76) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 17:53:53,014 INFO L444 ceAbstractionStarter]: At program point L221(lines 212 222) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-12-03 17:53:53,014 INFO L444 ceAbstractionStarter]: At program point L246(lines 246 258) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-12-03 17:53:53,015 INFO L444 ceAbstractionStarter]: At program point L306(lines 198 306) the Hoare annotation is: (let ((.cse0 (not (= ~send3 (+ (* 256 (div ~send3 256)) 255)))) (.cse2 (div ~mode1 256)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse1 (div ~mode3 256)) (.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 .cse1)) (= ~mode1 (* 256 .cse2)) .cse3 .cse4 .cse5) (and .cse0 (<= .cse2 0) (<= 1 ~mode1) (<= 1 ~mode3) .cse3 (<= .cse1 0) .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:53:53,015 INFO L444 ceAbstractionStarter]: At program point L205(lines 205 213) the Hoare annotation is: (let ((.cse0 (not (= ~send3 (+ (* 256 (div ~send3 256)) 255)))) (.cse2 (div ~mode1 256)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse1 (div ~mode3 256)) (.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 .cse1)) (= ~mode1 (* 256 .cse2)) .cse3 .cse4 .cse5) (and .cse0 (<= .cse2 0) (<= 1 ~mode1) (<= 1 ~mode3) .cse3 (<= .cse1 0) .cse4 .cse5 (not (= ~p3_old ~nomsg))))) [2018-12-03 17:53:53,015 INFO L444 ceAbstractionStarter]: At program point L226(lines 226 236) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-12-03 17:53:53,015 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 309) no Hoare annotation was computed. [2018-12-03 17:53:53,015 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 309) no Hoare annotation was computed. [2018-12-03 17:53:53,016 INFO L444 ceAbstractionStarter]: At program point L276(lines 276 283) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 17:53:53,016 INFO L444 ceAbstractionStarter]: At program point L241(lines 235 242) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-12-03 17:53:53,016 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 307) the Hoare annotation is: false [2018-12-03 17:53:53,016 INFO L444 ceAbstractionStarter]: At program point L297(lines 297 304) the Hoare annotation is: (and (<= (mod ~r1 256) 0) (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= 1 ULTIMATE.start_check_~tmp~76) (<= (div ULTIMATE.start_assert_~arg 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 17:53:53,016 INFO L444 ceAbstractionStarter]: At program point L264(lines 257 265) the Hoare annotation is: (and (not (= ~send3 (+ (* 256 (div ~send3 256)) 255))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (not (= ~p3_new ~nomsg)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-12-03 17:53:53,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 308) no Hoare annotation was computed. [2018-12-03 17:53:53,033 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:53:53 BoogieIcfgContainer [2018-12-03 17:53:53,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:53:53,034 INFO L168 Benchmark]: Toolchain (without parser) took 15283.30 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -769.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-12-03 17:53:53,035 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:53:53,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.65 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:53:53,036 INFO L168 Benchmark]: Boogie Preprocessor took 32.28 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:53:53,037 INFO L168 Benchmark]: RCFGBuilder took 558.22 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 17:53:53,038 INFO L168 Benchmark]: TraceAbstraction took 14649.32 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.2 MB). Peak memory consumption was 964.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:53:53,042 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.19 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 38.65 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.28 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 558.22 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14649.32 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.2 MB). Peak memory consumption was 964.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 308]: 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: 282]: Loop Invariant Derived loop invariant: ((((((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 1 <= check_~tmp~76) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) || ((((((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) || ((((((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && !(~p3_new == ~nomsg)) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: ((((((((((~r1 % 256 <= 0 && !(~send3 == 256 * (~send3 / 256) + 255)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 1 <= check_~tmp~76) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && 1 <= assert_~arg) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (((((((!(~send3 == 256 * (~send3 / 256) + 255) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 14.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 136 SDslu, 136 SDs, 0 SdLazy, 142 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 31 NumberOfFragments, 535 HoareAnnotationTreeSize, 11 FomulaSimplifications, 837 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 62 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 230 ConstructedInterpolants, 6 QuantifiedInterpolants, 24348 SizeOfPredicates, 1 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 196/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...