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.5.1.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:54:54,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:54:54,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:54:54,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:54:54,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:54:54,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:54:54,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:54:54,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:54:54,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:54:54,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:54:54,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:54:54,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:54:54,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:54:54,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:54:54,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:54:54,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:54:54,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:54:54,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:54:54,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:54:54,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:54:54,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:54:54,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:54:54,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:54:54,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:54:54,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:54:54,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:54:54,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:54:54,457 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:54:54,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:54:54,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:54:54,459 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:54:54,460 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:54:54,460 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:54:54,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:54:54,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:54:54,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:54:54,463 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:54:54,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:54:54,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:54:54,476 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:54:54,476 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:54:54,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:54:54,477 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:54:54,477 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:54:54,477 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:54:54,477 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:54:54,477 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:54:54,477 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:54:54,478 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:54:54,478 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:54:54,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:54:54,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:54:54,479 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:54:54,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:54:54,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:54:54,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:54:54,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:54:54,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:54:54,480 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:54:54,480 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:54:54,480 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:54:54,480 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:54:54,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:54:54,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:54:54,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:54:54,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:54:54,481 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:54:54,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:54:54,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:54:54,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:54:54,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:54:54,482 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:54:54,482 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:54:54,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:54:54,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:54:54,483 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:54:54,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:54:54,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:54:54,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:54:54,558 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:54:54,558 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:54:54,559 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.5.1.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 17:54:54,559 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl' [2018-12-03 17:54:54,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:54:54,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:54:54,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:54,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:54:54,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:54:54,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:54,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:54:54,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:54:54,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:54:54,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/1) ... [2018-12-03 17:54:54,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:54:54,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:54:54,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:54:54,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:54:54,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (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:54:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:54:54,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:54:55,482 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:54:55,482 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:54:55,483 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:54:55 BoogieIcfgContainer [2018-12-03 17:54:55,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:54:55,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:54:55,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:54:55,487 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:54:55,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:54:54" (1/2) ... [2018-12-03 17:54:55,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf1ad3 and model type pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:54:55, skipping insertion in model container [2018-12-03 17:54:55,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:54:55" (2/2) ... [2018-12-03 17:54:55,491 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 17:54:55,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:54:55,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:54:55,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:54:55,566 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:54:55,566 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:54:55,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:54:55,567 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:54:55,567 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:54:55,567 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:54:55,567 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:54:55,567 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:54:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 17:54:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:55,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:55,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:55,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:55,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-12-03 17:54:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:55,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:55,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:55,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:55,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:55,846 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:54:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:55,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:55,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:55,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:55,873 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 17:54:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:55,931 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 17:54:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:55,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:55,944 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:54:55,944 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:54:55,948 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:54:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:54:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 17:54:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:54:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 17:54:55,994 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 17:54:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:55,994 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 17:54:55,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 17:54:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:55,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:55,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:55,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:55,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-12-03 17:54:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:56,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:56,126 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:54:56,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:56,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:56,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:56,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:56,130 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 17:54:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:56,189 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 17:54:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:56,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:56,196 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:54:56,196 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:54:56,198 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:54:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:54:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 17:54:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:54:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 17:54:56,221 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 17:54:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:56,222 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 17:54:56,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 17:54:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:56,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:56,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:56,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:56,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-12-03 17:54:56,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:56,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:56,362 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:54:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:56,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:56,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:56,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:56,364 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 17:54:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:56,428 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 17:54:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:56,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:56,433 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:54:56,434 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:54:56,435 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:54:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:54:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 17:54:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:54:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 17:54:56,473 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 17:54:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:56,478 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 17:54:56,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 17:54:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:56,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:56,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:56,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:56,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-12-03 17:54:56,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:56,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:56,732 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:54:56,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:56,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:54:56,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:56,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:54:56,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:54:56,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:54:56,735 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 4 states. [2018-12-03 17:54:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:56,958 INFO L93 Difference]: Finished difference Result 245 states and 331 transitions. [2018-12-03 17:54:56,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:54:56,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:54:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:56,962 INFO L225 Difference]: With dead ends: 245 [2018-12-03 17:54:56,962 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 17:54:56,963 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:54:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 17:54:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 131. [2018-12-03 17:54:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 17:54:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2018-12-03 17:54:57,010 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 16 [2018-12-03 17:54:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:57,011 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2018-12-03 17:54:57,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:54:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2018-12-03 17:54:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:54:57,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:57,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:57,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:57,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-12-03 17:54:57,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:57,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:57,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:57,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:57,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:57,101 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:54:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:57,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:57,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:57,103 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 3 states. [2018-12-03 17:54:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:57,209 INFO L93 Difference]: Finished difference Result 319 states and 425 transitions. [2018-12-03 17:54:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:57,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:54:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:57,211 INFO L225 Difference]: With dead ends: 319 [2018-12-03 17:54:57,212 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 17:54:57,213 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:54:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 17:54:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 17:54:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 17:54:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-12-03 17:54:57,276 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-12-03 17:54:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:57,277 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-12-03 17:54:57,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-12-03 17:54:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:54:57,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:57,279 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:57,279 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:57,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1265916431, now seen corresponding path program 1 times [2018-12-03 17:54:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:57,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:57,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:57,560 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:54:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:57,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:57,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:57,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:57,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:57,566 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-12-03 17:54:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:57,694 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-12-03 17:54:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:57,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:54:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:57,698 INFO L225 Difference]: With dead ends: 561 [2018-12-03 17:54:57,698 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 17:54:57,700 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:54:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 17:54:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-12-03 17:54:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 17:54:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 17:54:57,778 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-12-03 17:54:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:57,779 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 17:54:57,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 17:54:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:54:57,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:57,782 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:57,782 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:57,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1524081869, now seen corresponding path program 1 times [2018-12-03 17:54:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:57,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:57,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:58,005 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:54:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:58,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:58,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:58,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:58,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:58,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:58,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:58,012 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 17:54:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:58,218 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 17:54:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:58,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:54:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:58,224 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 17:54:58,224 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 17:54:58,231 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:54:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 17:54:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 17:54:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 17:54:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 17:54:58,384 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 17:54:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:58,384 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 17:54:58,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 17:54:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:54:58,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:58,390 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:58,390 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:58,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash -714735243, now seen corresponding path program 1 times [2018-12-03 17:54:58,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:58,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:58,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:58,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:58,841 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 17:54:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:58,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:54:58,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:54:58,860 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 17:54:58,861 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 17:54:58,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:54:58,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:55:00,325 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:55:37,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:55:37,568 INFO L272 AbstractInterpreter]: Visited 23 different actions 231 times. Merged at 22 different actions 161 times. Widened at 12 different actions 12 times. Found 46 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 17:55:37,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:37,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:55:37,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:37,580 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:55:37,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:37,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:55:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:37,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:55:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:55:38,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:55:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:55:38,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:55:38,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 17:55:38,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:55:38,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:55:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:55:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:55:38,413 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-12-03 17:55:38,640 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:55:38,918 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:55:39,406 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:55:39,729 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:55:39,996 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 17:55:40,706 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 17:55:41,110 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:55:41,843 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:55:42,432 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:55:42,747 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:55:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:42,770 INFO L93 Difference]: Finished difference Result 1609 states and 2019 transitions. [2018-12-03 17:55:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:55:42,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-03 17:55:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:42,774 INFO L225 Difference]: With dead ends: 1609 [2018-12-03 17:55:42,774 INFO L226 Difference]: Without dead ends: 565 [2018-12-03 17:55:42,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:55:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-12-03 17:55:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 515. [2018-12-03 17:55:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-12-03 17:55:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-12-03 17:55:42,885 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 30 [2018-12-03 17:55:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:42,885 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-12-03 17:55:42,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:55:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-12-03 17:55:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:55:42,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:42,890 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:55:42,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:42,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:42,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1918843925, now seen corresponding path program 2 times [2018-12-03 17:55:42,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:42,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:42,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-03 17:55:42,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:42,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:42,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:42,984 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 3 states. [2018-12-03 17:55:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:43,005 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-12-03 17:55:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:43,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 17:55:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:43,006 INFO L225 Difference]: With dead ends: 515 [2018-12-03 17:55:43,006 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:55:43,007 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:55:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:55:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:55:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:55:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:55:43,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 17:55:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:43,008 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:55:43,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:55:43,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:55:43,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:55:43,565 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 17:55:44,774 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 17:55:45,116 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 17:55:45,360 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 17:55:45,546 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 17:55:45,878 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 17:55:46,055 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 17:55:46,290 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 17:55:46,526 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 17:55:46,790 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 17:55:46,881 INFO L444 ceAbstractionStarter]: At program point L415(lines 409 416) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 17:55:46,881 INFO L444 ceAbstractionStarter]: At program point L461(lines 308 461) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 17:55:46,882 INFO L444 ceAbstractionStarter]: At program point L395(lines 389 396) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 17:55:46,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 464) no Hoare annotation was computed. [2018-12-03 17:55:46,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 464) no Hoare annotation was computed. [2018-12-03 17:55:46,882 INFO L444 ceAbstractionStarter]: At program point L375(lines 369 376) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 17:55:46,883 INFO L444 ceAbstractionStarter]: At program point L400(lines 400 410) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 17:55:46,883 INFO L444 ceAbstractionStarter]: At program point L458(lines 458 462) the Hoare annotation is: false [2018-12-03 17:55:46,883 INFO L444 ceAbstractionStarter]: At program point L355(lines 349 356) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 17:55:46,883 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 464) no Hoare annotation was computed. [2018-12-03 17:55:46,883 INFO L444 ceAbstractionStarter]: At program point L380(lines 380 390) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 17:55:46,884 INFO L444 ceAbstractionStarter]: At program point L442(lines 438 443) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:55:46,884 INFO L444 ceAbstractionStarter]: At program point L335(lines 326 336) the Hoare annotation is: (let ((.cse9 (div ~mode2 256))) (let ((.cse2 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= .cse9 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse9)) .cse4 .cse6 .cse8) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 17:55:46,884 INFO L444 ceAbstractionStarter]: At program point L360(lines 360 370) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse5 .cse6))) [2018-12-03 17:55:46,884 INFO L444 ceAbstractionStarter]: At program point L315(lines 315 327) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (<= ~send1 127)) (.cse1 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse1)) .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse2 (<= .cse1 0) .cse3))) [2018-12-03 17:55:46,885 INFO L444 ceAbstractionStarter]: At program point L340(lines 340 350) the Hoare annotation is: (let ((.cse9 (div ~mode2 256))) (let ((.cse2 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= .cse9 0)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse9)) .cse4 .cse6 .cse8) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6)))) [2018-12-03 17:55:46,885 INFO L444 ceAbstractionStarter]: At program point L431(lines 431 439) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse4 .cse5))) [2018-12-03 17:55:46,885 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 463) no Hoare annotation was computed. [2018-12-03 17:55:46,885 INFO L444 ceAbstractionStarter]: At program point L452(lines 452 459) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 17:55:46,911 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:55:46 BoogieIcfgContainer [2018-12-03 17:55:46,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:55:46,913 INFO L168 Benchmark]: Toolchain (without parser) took 52278.44 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 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 977.0 MB. Max. memory is 7.1 GB. [2018-12-03 17:55:46,914 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:55:46,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.69 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:55:46,915 INFO L168 Benchmark]: Boogie Preprocessor took 63.35 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:55:46,915 INFO L168 Benchmark]: RCFGBuilder took 727.18 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:55:46,916 INFO L168 Benchmark]: TraceAbstraction took 51427.63 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 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 945.3 MB. Max. memory is 7.1 GB. [2018-12-03 17:55:46,920 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.18 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 53.69 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 63.35 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 727.18 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 51427.63 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 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 945.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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: 452]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= check_~tmp~130) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode2 && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= check_~tmp~130) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 51.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 238 SDslu, 219 SDs, 0 SdLazy, 187 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 38.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 325 NumberOfFragments, 1543 HoareAnnotationTreeSize, 15 FomulaSimplifications, 19666 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 277 ConstructedInterpolants, 10 QuantifiedInterpolants, 32053 SizeOfPredicates, 1 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 130/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...