java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:49:00,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:49:00,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:49:00,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:49:00,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:49:00,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:49:00,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:49:00,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:49:00,947 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:49:00,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:49:00,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:49:00,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:49:00,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:49:00,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:49:00,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:49:00,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:49:00,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:49:00,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:49:00,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:49:00,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:49:00,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:49:00,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:49:00,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:49:00,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:49:00,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:49:00,988 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:49:00,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:49:00,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:49:00,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:49:00,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:49:00,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:49:00,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:49:00,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:49:00,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:49:00,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:49:01,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:49:01,000 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:49:01,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:49:01,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:49:01,030 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:49:01,030 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:49:01,030 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:49:01,030 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:49:01,031 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:49:01,031 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:49:01,031 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:49:01,031 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:49:01,031 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:49:01,032 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:49:01,035 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:49:01,035 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:49:01,036 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:49:01,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:49:01,036 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:49:01,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:49:01,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:49:01,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:49:01,039 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:49:01,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:49:01,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:49:01,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:49:01,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:49:01,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:49:01,040 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:49:01,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:49:01,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:49:01,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:49:01,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:49:01,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:49:01,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:49:01,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:49:01,042 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:49:01,042 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:49:01,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:49:01,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:49:01,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:49:01,044 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:49:01,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:49:01,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:49:01,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:49:01,119 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:49:01,120 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:49:01,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 18:49:01,121 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl' [2018-12-03 18:49:01,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:49:01,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:49:01,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:49:01,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:49:01,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:49:01,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:49:01,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:49:01,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:49:01,261 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:49:01,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/1) ... [2018-12-03 18:49:01,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:49:01,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:49:01,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:49:01,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:49:01,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (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 18:49:01,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:49:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:49:01,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:49:01,957 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:49:01,958 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:49:01,958 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:49:01 BoogieIcfgContainer [2018-12-03 18:49:01,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:49:01,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:49:01,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:49:01,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:49:01,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:49:01" (1/2) ... [2018-12-03 18:49:01,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e69cf92 and model type pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:49:01, skipping insertion in model container [2018-12-03 18:49:01,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:49:01" (2/2) ... [2018-12-03 18:49:01,966 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 18:49:01,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:49:01,984 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:49:02,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:49:02,037 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:49:02,037 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:49:02,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:49:02,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:49:02,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:49:02,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:49:02,038 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:49:02,038 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:49:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 18:49:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:02,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:02,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:02,064 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:02,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 18:49:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:02,300 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 18:49:02,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:02,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:49:02,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:02,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:02,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:02,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:02,323 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 18:49:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:02,380 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2018-12-03 18:49:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:02,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 18:49:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:02,392 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:49:02,392 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:49:02,396 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 18:49:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:49:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:49:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:49:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-12-03 18:49:02,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2018-12-03 18:49:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:02,432 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-03 18:49:02,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-12-03 18:49:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:02,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:02,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:02,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:02,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:02,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 18:49:02,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:02,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:02,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:02,614 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 18:49:02,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:02,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:49:02,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:02,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:02,620 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2018-12-03 18:49:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:02,680 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-12-03 18:49:02,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:02,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 18:49:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:02,683 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:49:02,684 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:49:02,688 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 18:49:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:49:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:49:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:49:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-03 18:49:02,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2018-12-03 18:49:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:02,696 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-03 18:49:02,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-12-03 18:49:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:02,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:02,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:02,699 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1686901289, now seen corresponding path program 1 times [2018-12-03 18:49:02,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:02,823 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 18:49:02,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:49:02,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:02,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:02,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:02,825 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2018-12-03 18:49:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:02,871 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-12-03 18:49:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:02,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 18:49:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:02,873 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:49:02,873 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:49:02,874 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 18:49:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:49:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:49:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:49:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-03 18:49:02,880 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 16 [2018-12-03 18:49:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:02,881 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-03 18:49:02,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-12-03 18:49:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:02,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:02,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:02,882 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:02,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2079928299, now seen corresponding path program 1 times [2018-12-03 18:49:02,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:02,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:02,975 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 18:49:02,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:02,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:49:02,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:02,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:02,978 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 3 states. [2018-12-03 18:49:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:03,010 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-12-03 18:49:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:03,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 18:49:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:03,012 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:49:03,012 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:49:03,013 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 18:49:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:49:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:49:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:49:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-03 18:49:03,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-12-03 18:49:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:03,021 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-03 18:49:03,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-12-03 18:49:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:03,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:03,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:03,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:03,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:03,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1270581673, now seen corresponding path program 1 times [2018-12-03 18:49:03,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:03,105 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 18:49:03,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:03,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:49:03,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:03,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:03,107 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 3 states. [2018-12-03 18:49:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:03,182 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-12-03 18:49:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:03,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 18:49:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:03,184 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:49:03,184 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:49:03,185 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 18:49:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:49:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-03 18:49:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:49:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-12-03 18:49:03,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2018-12-03 18:49:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:03,199 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-12-03 18:49:03,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2018-12-03 18:49:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:03,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:03,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:03,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:03,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1213323371, now seen corresponding path program 1 times [2018-12-03 18:49:03,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:03,322 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 18:49:03,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:03,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:49:03,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:03,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:49:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:49:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:49:03,324 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 4 states. [2018-12-03 18:49:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:03,432 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-12-03 18:49:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:49:03,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 18:49:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:03,436 INFO L225 Difference]: With dead ends: 90 [2018-12-03 18:49:03,436 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:49:03,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:49:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:49:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-12-03 18:49:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:49:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-03 18:49:03,451 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2018-12-03 18:49:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:03,451 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-03 18:49:03,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:49:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-03 18:49:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:49:03,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:03,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:03,454 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:03,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1213382953, now seen corresponding path program 1 times [2018-12-03 18:49:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:03,574 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 18:49:03,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:03,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:49:03,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:03,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:49:03,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:49:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:49:03,576 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 4 states. [2018-12-03 18:49:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:03,669 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-12-03 18:49:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:49:03,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 18:49:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:03,672 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:49:03,673 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 18:49:03,673 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 18:49:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 18:49:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-03 18:49:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:49:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-12-03 18:49:03,687 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 16 [2018-12-03 18:49:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:03,687 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-03 18:49:03,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:49:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-12-03 18:49:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:49:03,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:03,689 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 18:49:03,689 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:03,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1468461941, now seen corresponding path program 1 times [2018-12-03 18:49:03,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:03,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:03,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:03,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:03,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:03,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:03,861 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 18:49:03,863 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 18:49:03,930 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:49:03,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:49:04,867 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:49:10,871 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:49:10,873 INFO L272 AbstractInterpreter]: Visited 22 different actions 55 times. Merged at 17 different actions 23 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:49:10,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:10,883 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:49:12,171 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 58.55% of their original sizes. [2018-12-03 18:49:12,172 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:49:19,972 INFO L418 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-12-03 18:49:19,972 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:49:19,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:49:19,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [4] total 25 [2018-12-03 18:49:19,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:19,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:49:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:49:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:49:19,975 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 23 states. [2018-12-03 18:49:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:49,942 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-12-03 18:49:49,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:49:49,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-12-03 18:49:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:49,945 INFO L225 Difference]: With dead ends: 146 [2018-12-03 18:49:49,945 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 18:49:49,947 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:49:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 18:49:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 57. [2018-12-03 18:49:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:49:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-12-03 18:49:50,041 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 30 [2018-12-03 18:49:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:50,042 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-12-03 18:49:50,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:49:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-12-03 18:49:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:49:50,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:50,043 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:50,044 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:50,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1260860269, now seen corresponding path program 2 times [2018-12-03 18:49:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:50,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:50,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:50,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 18:49:50,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:50,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:49:50,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:50,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:50,148 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-12-03 18:49:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:50,261 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-12-03 18:49:50,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:50,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 18:49:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:50,262 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:49:50,262 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:49:50,263 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 18:49:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:49:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:49:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:49:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:49:50,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-12-03 18:49:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:50,264 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:49:50,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:49:50,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:49:50,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:49:51,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:52,494 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 1112 DAG size of output: 1100 [2018-12-03 18:49:54,151 WARN L180 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 1404 [2018-12-03 18:49:57,788 WARN L180 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 2134 [2018-12-03 18:49:58,565 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 1010 DAG size of output: 998 [2018-12-03 18:50:00,926 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 1681 DAG size of output: 1679 [2018-12-03 18:50:01,955 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 1193 DAG size of output: 1189 [2018-12-03 18:50:05,604 WARN L180 SmtUtils]: Spent 3.65 s on a formula simplification that was a NOOP. DAG size: 2134 [2018-12-03 18:50:06,575 WARN L180 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 1209 DAG size of output: 1201 [2018-12-03 18:50:06,892 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 646 DAG size of output: 632 [2018-12-03 18:50:08,063 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 1308 DAG size of output: 1303 [2018-12-03 18:50:09,488 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 1343 DAG size of output: 1341 [2018-12-03 18:50:11,728 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 1681 DAG size of output: 1679 [2018-12-03 18:50:12,774 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 1193 DAG size of output: 1189 [2018-12-03 18:50:14,308 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 1343 DAG size of output: 1341 [2018-12-03 18:50:30,123 WARN L180 SmtUtils]: Spent 15.80 s on a formula simplification. DAG size of input: 1099 DAG size of output: 71 [2018-12-03 18:50:56,323 WARN L180 SmtUtils]: Spent 26.20 s on a formula simplification. DAG size of input: 1404 DAG size of output: 81 [2018-12-03 18:52:07,564 WARN L180 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 2134 DAG size of output: 188 [2018-12-03 18:52:20,459 WARN L180 SmtUtils]: Spent 12.89 s on a formula simplification. DAG size of input: 998 DAG size of output: 70 [2018-12-03 18:53:00,670 WARN L180 SmtUtils]: Spent 40.20 s on a formula simplification. DAG size of input: 1679 DAG size of output: 150 [2018-12-03 18:53:20,709 WARN L180 SmtUtils]: Spent 20.03 s on a formula simplification. DAG size of input: 1189 DAG size of output: 119 [2018-12-03 18:54:31,884 WARN L180 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 2134 DAG size of output: 188 [2018-12-03 18:54:50,647 WARN L180 SmtUtils]: Spent 18.76 s on a formula simplification. DAG size of input: 1200 DAG size of output: 73 [2018-12-03 18:54:55,690 WARN L180 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 632 DAG size of output: 51 [2018-12-03 18:55:17,905 WARN L180 SmtUtils]: Spent 22.21 s on a formula simplification. DAG size of input: 1302 DAG size of output: 75 [2018-12-03 18:55:43,348 WARN L180 SmtUtils]: Spent 25.44 s on a formula simplification. DAG size of input: 1341 DAG size of output: 137 [2018-12-03 18:56:23,557 WARN L180 SmtUtils]: Spent 40.20 s on a formula simplification. DAG size of input: 1679 DAG size of output: 150 [2018-12-03 18:56:43,606 WARN L180 SmtUtils]: Spent 20.04 s on a formula simplification. DAG size of input: 1189 DAG size of output: 119 [2018-12-03 18:57:09,077 WARN L180 SmtUtils]: Spent 25.46 s on a formula simplification. DAG size of input: 1341 DAG size of output: 137 [2018-12-03 18:57:09,080 INFO L444 ceAbstractionStarter]: At program point L287(lines 280 288) the Hoare annotation is: (let ((.cse1 (+ ~p4_new 1)) (.cse2 (<= 0 (+ ~p1_new ~st3 1))) (.cse3 (<= (+ ~p1_new 1) ~st1))) (or (let ((.cse0 (+ ~mode4 255))) (and (<= ~id4 ~send4) (<= (+ ~mode4 256) 0) (<= (+ ~mode3 257) 0) (<= (+ ~send3 ~send4) 253) (<= ~send4 ~id4) (<= ULTIMATE.start_main_~i2~108 ~r1) (<= 0 (+ ~mode2 ~mode4 255)) (<= ~p3_new ~p4_new) (<= ~p3_old .cse0) (<= 1 (+ ~send3 ~id4)) (<= 0 (+ ~mode1 ~mode4 255)) (<= ~st1 ~st4) (<= ~st4 (+ ~p2_old 1)) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~send3)) (<= ~mode1 (+ ~nomsg 2)) (<= ~mode2 (+ ~p3_new 2)) (<= ~mode2 (+ ULTIMATE.start_main_~i2~108 1)) (<= (* 2 ~alive3) 510) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st2) 0) (<= ~id4 (+ ~r1 127)) (<= .cse1 ~alive3) .cse2 (<= (+ ~nomsg ~p2_old 2) 0) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~send3 (+ ~st2 127)) (<= ~p2_new .cse0) (<= (* 2 ~r1) 0) (<= (+ ~st3 ~p4_new 1) 0) (<= ~st2 ~send4) .cse3 (<= (+ ~st2 512) ~alive4))) (and (let ((.cse6 (* 2 ULTIMATE.start_assert_~arg)) (.cse5 (* 2 ULTIMATE.start_main_~c1~108)) (.cse4 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse7 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= ~mode3 ~mode4) (<= .cse4 2) (<= .cse5 2) (<= 2 .cse6) (<= .cse6 2) (<= ~mode4 ~r1) (<= 2 .cse5) (<= 2 .cse4) (<= ~mode3 (+ ~p3_old 1)) (<= .cse7 2) (<= 2 .cse7) (<= (+ ~st4 ~p4_new 1) 0) (<= ~st3 .cse1) (<= 0 (+ (* 2 ~p3_new) 2)) (<= (+ ~p3_new 1) ~st1) (<= (+ ~st1 ~mode3) 1) .cse2 (<= 0 (+ ~st4 ~p2_old 1)) (<= ~p2_new ~p1_new) (<= (+ ~p1_new ~p3_old) 126) (<= (+ ~st2 ~p2_old 1) 0) (<= ~nomsg ~p2_new) .cse3 (<= ~r1 (+ ~st2 1)) (<= ~st2 (+ ~nomsg 1)))) (<= 1 ~mode3)))) [2018-12-03 18:57:09,081 INFO L444 ceAbstractionStarter]: At program point L316(lines 316 325) the Hoare annotation is: (let ((.cse12 (+ ~p1_new 1)) (.cse13 (+ ~p4_new 1)) (.cse3 (+ ~mode4 255))) (let ((.cse0 (<= ~p3_old .cse3)) (.cse1 (<= ~st3 .cse13)) (.cse2 (<= 0 (+ ~p1_new ~st3 1))) (.cse4 (<= ~nomsg ~p2_new)) (.cse5 (<= .cse12 ~st1)) (.cse6 (<= .cse13 ~st2)) (.cse7 (<= ~st2 (+ ~nomsg 1)))) (or (and (<= ~id4 ~send4) (<= (+ ~send4 ~p3_new) 253) (<= 1 (+ ~r1 ~mode3)) (<= ~send4 ~id4) (<= (+ ~mode4 256) 0) (<= ULTIMATE.start_main_~i2~108 ~r1) (<= 0 (+ ~mode2 ~mode4 255)) .cse0 (<= 0 (+ ~mode1 ~mode4 255)) .cse1 (<= ~mode1 (+ ~nomsg 2)) (<= (+ ~st1 ~mode3) 1) (<= ~st4 ~r1) .cse2 (<= ~r1 ULTIMATE.start_main_~i2~108) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~p3_new (+ ~p3_old 128)) (<= ~p2_new .cse3) .cse4 (<= (+ ~p1_new ~mode2) 0) (<= ~st2 ~send4) .cse5 (<= ~r1 (+ ~p2_new 1)) .cse6 (<= 0 (+ ~p1_new ~p3_new 1)) (<= (+ ~st2 512) ~alive4) (<= ~send4 (+ ~r1 127)) .cse7) (let ((.cse10 (* 2 ULTIMATE.start_assert_~arg)) (.cse9 (* 2 ULTIMATE.start_main_~c1~108)) (.cse8 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse11 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= ~mode3 ~mode4) (<= .cse8 2) (<= 0 (+ ~r1 ~p3_new)) (<= .cse9 2) (<= 2 .cse10) (<= 0 (+ ~p3_new ~p3_old 1)) (<= .cse10 2) (<= 2 .cse9) (<= 2 .cse8) (<= .cse11 2) (<= 2 .cse11) .cse0 (<= (+ ~st4 ~p4_new 1) 0) (<= ~st1 (+ ~p2_old 1)) .cse1 (<= (+ ~p3_new 1) ~st1) (<= (+ ~st2 ~mode4) 1) (<= .cse12 ~r1) .cse2 (<= 0 (+ ~st4 ~p2_old 1)) (<= ~p2_new ~p1_new) (<= (+ ~p1_new ~p3_old) 126) (<= (+ ~st2 ~p2_old 1) 0) .cse4 .cse5 (<= ~r1 (+ ~st2 1)) .cse6 .cse7))))) [2018-12-03 18:57:09,082 INFO L444 ceAbstractionStarter]: At program point L250(lines 250 262) the Hoare annotation is: (let ((.cse14 (+ ~p1_old 1))) (let ((.cse5 (<= ~st4 .cse14)) (.cse4 (+ ~p3_new 1)) (.cse8 (<= (+ ~st3 ~p4_new 1) 0)) (.cse7 (+ ~p4_new 1)) (.cse9 (<= (+ (* 2 ~p4_old) 2) 0))) (or (let ((.cse1 (+ ~send3 ~id1)) (.cse0 (+ ~send3 ~id2)) (.cse6 (+ ~r1 127)) (.cse3 (+ ~mode4 255)) (.cse2 (+ ~send4 ~id1))) (and (<= ~send1 ~id1) (<= ~id4 ~send4) (<= 1 .cse0) (<= (+ ~mode3 257) 0) (<= .cse1 253) (<= ~id1 ~send1) (<= ~send2 ~id2) (<= 512 ~mode2) (<= 1 (+ ~send1 ~id2)) (<= (+ ~send3 ~send4) 253) (<= ~mode4 ~mode1) (<= 1 .cse1) (<= (+ ~mode1 256) 0) (<= (+ ~send1 ~send2) 253) (<= .cse0 253) (<= ~send4 ~id4) (<= 1 .cse2) (<= ULTIMATE.start_main_~i2~108 (+ ~mode4 256)) (<= 1 (+ ~id2 ~id4)) (<= ~p3_new ~p4_new) (<= (+ (* 2 ~alive1) 514) 0) (<= (+ ~send4 ~id2) 253) (<= ~p3_old .cse3) (<= 1 (+ ~send3 ~id4)) (<= ~st1 ~st4) (<= ~id2 ~send2) (<= ~st2 .cse4) .cse5 (<= 0 (+ ~p2_old ~p4_old 2)) (<= (* 2 ~alive3) 510) (<= (+ ~send1 ~st1) 127) (<= 0 (+ ~send1 ~id1)) (<= ~p1_old ~nomsg) (<= 0 (+ ~p2_new ~st2 1)) (<= ~r1 ~send3) (<= (+ ~p1_new 1) ~r1) (<= ~id4 .cse6) (<= .cse7 ~alive3) (<= 0 (+ ~p1_new ~st3 1)) (<= ~id2 .cse6) (<= (+ ~nomsg ~p2_old 2) 0) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~p1_old 1)) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~send3 (+ ~st2 127)) (<= ~p2_new .cse3) (<= (* 2 ~r1) 0) .cse8 (<= ~st2 ~send4) (<= .cse2 253) (<= (+ ~alive2 256) ~p3_new) .cse9 (<= .cse4 ~send2) (<= (+ ~st2 512) ~alive4) (<= 0 (+ ~st1 ~p4_old 1)))) (let ((.cse12 (* 2 ULTIMATE.start_assert_~arg)) (.cse11 (* 2 ULTIMATE.start_main_~c1~108)) (.cse10 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse13 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= 1 ~mode3) (<= .cse10 2) (<= .cse11 2) (<= ~mode3 ~mode1) (<= ~mode1 ~mode4) (<= 2 .cse12) (<= .cse12 2) (<= 2 .cse11) (<= 2 .cse10) (<= ~mode3 (+ ~p3_old 1)) (<= .cse13 2) (<= 2 .cse13) .cse5 (<= .cse4 ~st1) (<= 0 (+ ~p3_new ~p4_old 2)) (<= (+ ~st1 ~mode3) 1) (<= ~st4 ~r1) (<= ULTIMATE.start_main_~i2~108 (+ ~p2_old 2)) (<= ~p2_new ~p1_new) (<= 0 (+ ~p4_new ~p4_old 2)) (<= ~r1 ~st4) (<= (+ ~mode1 ~p3_old) 128) (<= ULTIMATE.start_main_~i2~108 (+ ~r1 1)) (<= ~mode4 ULTIMATE.start_main_~i2~108) (<= ULTIMATE.start_main_~i2~108 (+ ~st3 1)) (<= .cse14 ~st4) (<= ~nomsg ~p2_new) .cse8 (<= ~r1 (+ ~p2_new 1)) (<= ~p1_new ~p4_old) (<= .cse7 ~st2) (<= (+ ~mode1 ~p2_old) 0) .cse9 (<= ~st2 (+ ~nomsg 1)) (<= (+ ~p4_old 2) ~mode2)))))) [2018-12-03 18:57:09,083 INFO L444 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (let ((.cse0 (+ ~p4_new 1))) (and (<= ~st4 ~r1) (<= 0 (+ ~st4 ~p2_old 1)) (<= (+ ~p2_old 2) ~mode3) (<= 1 (+ ~st3 ~mode4)) (<= (+ ~p3_new 1) ~st1) (<= ~p2_new ~p1_new) (<= 1 (+ ~st2 ~mode1)) (<= 0 (+ ~p4_new ~p4_old 2)) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~p1_old 1)) (<= .cse0 ~p3_old) (<= ULTIMATE.start_main_~i2~108 ~st4) (<= (+ ~p1_old 1) ~st4) (<= (+ ~st2 ~mode4) 1) (<= ~nomsg ~p2_new) (<= ~p3_old (+ ULTIMATE.start_main_~i2~108 127)) (<= (+ ~st3 ~p4_new 1) 0) (<= (+ ~p1_new ~mode2) 0) (<= (+ ~r1 1) ~mode4) (<= .cse0 ~st2) (<= (+ ~mode1 ~p2_old) 0) (<= 0 (+ ~p3_new ~mode4)) (<= (+ ~mode3 ~p4_old) 0) (<= (+ (* 2 ~p4_old) 2) 0) (<= (+ ~st1 1) ~mode2) (<= ~st2 (+ ~nomsg 1)))) [2018-12-03 18:57:09,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 18:57:09,083 INFO L444 ceAbstractionStarter]: At program point L267(lines 261 268) the Hoare annotation is: (let ((.cse5 (<= ~st4 (+ ~p1_old 1))) (.cse7 (<= ~p1_old ~nomsg)) (.cse4 (+ ~p4_new 1)) (.cse8 (<= 0 (+ ~p1_new ~st3 1))) (.cse9 (<= 0 (+ ~st4 ~p2_old 1))) (.cse10 (<= (+ ~p1_new 1) ~st1)) (.cse6 (+ ~p3_new 1))) (or (and (let ((.cse2 (* 2 ULTIMATE.start_assert_~arg)) (.cse1 (* 2 ULTIMATE.start_main_~c1~108)) (.cse0 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse3 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= ~mode3 ~mode4) (<= .cse0 2) (<= .cse1 2) (<= 2 .cse2) (<= .cse2 2) (<= ~mode4 ~r1) (<= 2 .cse1) (<= 2 .cse0) (<= ~mode3 (+ ~p3_old 1)) (<= .cse3 2) (<= 2 .cse3) (<= ~st3 .cse4) (<= 0 (+ (* 2 ~p3_new) 2)) .cse5 (<= .cse6 ~st1) .cse7 (<= (+ ~st1 ~mode3) 1) .cse8 .cse9 (<= ~p2_new ~p1_new) (<= (+ ~p1_new ~p3_old) 126) (<= (+ ~st2 ~p2_old 1) 0) (<= ~nomsg ~p2_new) .cse10 (<= ~r1 (+ ~st2 1)) (<= .cse4 ~st2) (<= (+ ~st1 1) ~mode2))) (<= 1 ~mode3)) (let ((.cse11 (+ ~send3 ~id2)) (.cse13 (+ ~r1 127)) (.cse12 (+ ~mode4 255))) (and (<= ~id4 ~send4) (<= (+ ~mode4 256) 0) (<= 1 .cse11) (<= (+ ~mode3 257) 0) (<= ~send2 ~id2) (<= 512 ~mode2) (<= (+ ~send3 ~send4) 253) (<= .cse11 253) (<= ~send4 ~id4) (<= 1 (+ ULTIMATE.start_main_~i2~108 ~mode1)) (<= 1 (+ ~id2 ~id4)) (<= ULTIMATE.start_main_~i2~108 ~r1) (<= ~p3_new ~p4_new) (<= (+ ~send4 ~id2) 253) (<= ~p3_old .cse12) (<= 1 (+ ~send3 ~id4)) (<= ~st1 ~st4) (<= (+ ~st2 ~nomsg 1) 0) (<= ~id2 ~send2) (<= ~st2 .cse6) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~send3)) (<= ~mode1 (+ ~nomsg 2)) .cse5 (<= (* 2 ~alive3) 510) .cse7 (<= 0 (+ ~p2_new ~st2 1)) (<= ~id4 .cse13) (<= .cse4 ~alive3) .cse8 .cse9 (<= ~id2 .cse13) (<= (+ ~nomsg ~p2_old 2) 0) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~send3 (+ ~st2 127)) (<= ~p2_new .cse12) (<= (* 2 ~r1) 0) (<= (+ ~st3 ~p4_new 1) 0) (<= ~st2 ~send4) .cse10 (<= (+ ~alive2 256) ~p3_new) (<= .cse6 ~send2) (<= (+ ~st2 512) ~alive4))))) [2018-12-03 18:57:09,084 INFO L444 ceAbstractionStarter]: At program point L292(lines 292 302) the Hoare annotation is: (let ((.cse1 (+ ~p4_new 1)) (.cse2 (<= 0 (+ ~p1_new ~st3 1))) (.cse3 (<= (+ ~p1_new 1) ~st1))) (or (let ((.cse0 (+ ~mode4 255))) (and (<= ~id4 ~send4) (<= (+ ~mode4 256) 0) (<= (+ ~mode3 257) 0) (<= (+ ~send3 ~send4) 253) (<= ~send4 ~id4) (<= ULTIMATE.start_main_~i2~108 ~r1) (<= 0 (+ ~mode2 ~mode4 255)) (<= ~p3_new ~p4_new) (<= ~p3_old .cse0) (<= 1 (+ ~send3 ~id4)) (<= 0 (+ ~mode1 ~mode4 255)) (<= ~st1 ~st4) (<= ~st4 (+ ~p2_old 1)) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~send3)) (<= ~mode1 (+ ~nomsg 2)) (<= ~mode2 (+ ~p3_new 2)) (<= ~mode2 (+ ULTIMATE.start_main_~i2~108 1)) (<= (* 2 ~alive3) 510) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st3 ~st2) 0) (<= ~id4 (+ ~r1 127)) (<= .cse1 ~alive3) .cse2 (<= (+ ~nomsg ~p2_old 2) 0) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~send3 (+ ~st2 127)) (<= ~p2_new .cse0) (<= (* 2 ~r1) 0) (<= (+ ~st3 ~p4_new 1) 0) (<= ~st2 ~send4) .cse3 (<= (+ ~st2 512) ~alive4))) (and (let ((.cse6 (* 2 ULTIMATE.start_assert_~arg)) (.cse5 (* 2 ULTIMATE.start_main_~c1~108)) (.cse4 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse7 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= ~mode3 ~mode4) (<= .cse4 2) (<= .cse5 2) (<= 2 .cse6) (<= .cse6 2) (<= ~mode4 ~r1) (<= 2 .cse5) (<= 2 .cse4) (<= ~mode3 (+ ~p3_old 1)) (<= .cse7 2) (<= 2 .cse7) (<= (+ ~st4 ~p4_new 1) 0) (<= ~st3 .cse1) (<= 0 (+ (* 2 ~p3_new) 2)) (<= (+ ~p3_new 1) ~st1) (<= (+ ~st1 ~mode3) 1) .cse2 (<= 0 (+ ~st4 ~p2_old 1)) (<= ~p2_new ~p1_new) (<= (+ ~p1_new ~p3_old) 126) (<= (+ ~st2 ~p2_old 1) 0) (<= ~nomsg ~p2_new) .cse3 (<= ~r1 (+ ~st2 1)) (<= ~st2 (+ ~nomsg 1)))) (<= 1 ~mode3)))) [2018-12-03 18:57:09,084 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 61 391) no Hoare annotation was computed. [2018-12-03 18:57:09,084 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 61 391) no Hoare annotation was computed. [2018-12-03 18:57:09,085 INFO L444 ceAbstractionStarter]: At program point L272(lines 272 281) the Hoare annotation is: (let ((.cse5 (<= ~st4 (+ ~p1_old 1))) (.cse7 (<= ~p1_old ~nomsg)) (.cse4 (+ ~p4_new 1)) (.cse8 (<= 0 (+ ~p1_new ~st3 1))) (.cse9 (<= 0 (+ ~st4 ~p2_old 1))) (.cse10 (<= (+ ~p1_new 1) ~st1)) (.cse6 (+ ~p3_new 1))) (or (and (let ((.cse2 (* 2 ULTIMATE.start_assert_~arg)) (.cse1 (* 2 ULTIMATE.start_main_~c1~108)) (.cse0 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse3 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= ~mode3 ~mode4) (<= .cse0 2) (<= .cse1 2) (<= 2 .cse2) (<= .cse2 2) (<= ~mode4 ~r1) (<= 2 .cse1) (<= 2 .cse0) (<= ~mode3 (+ ~p3_old 1)) (<= .cse3 2) (<= 2 .cse3) (<= ~st3 .cse4) (<= 0 (+ (* 2 ~p3_new) 2)) .cse5 (<= .cse6 ~st1) .cse7 (<= (+ ~st1 ~mode3) 1) .cse8 .cse9 (<= ~p2_new ~p1_new) (<= (+ ~p1_new ~p3_old) 126) (<= (+ ~st2 ~p2_old 1) 0) (<= ~nomsg ~p2_new) .cse10 (<= ~r1 (+ ~st2 1)) (<= .cse4 ~st2) (<= (+ ~st1 1) ~mode2))) (<= 1 ~mode3)) (let ((.cse11 (+ ~send3 ~id2)) (.cse13 (+ ~r1 127)) (.cse12 (+ ~mode4 255))) (and (<= ~id4 ~send4) (<= (+ ~mode4 256) 0) (<= 1 .cse11) (<= (+ ~mode3 257) 0) (<= ~send2 ~id2) (<= 512 ~mode2) (<= (+ ~send3 ~send4) 253) (<= .cse11 253) (<= ~send4 ~id4) (<= 1 (+ ULTIMATE.start_main_~i2~108 ~mode1)) (<= 1 (+ ~id2 ~id4)) (<= ULTIMATE.start_main_~i2~108 ~r1) (<= ~p3_new ~p4_new) (<= (+ ~send4 ~id2) 253) (<= ~p3_old .cse12) (<= 1 (+ ~send3 ~id4)) (<= ~st1 ~st4) (<= (+ ~st2 ~nomsg 1) 0) (<= ~id2 ~send2) (<= ~st2 .cse6) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~send3)) (<= ~mode1 (+ ~nomsg 2)) .cse5 (<= (* 2 ~alive3) 510) .cse7 (<= 0 (+ ~p2_new ~st2 1)) (<= ~id4 .cse13) (<= .cse4 ~alive3) .cse8 .cse9 (<= ~id2 .cse13) (<= (+ ~nomsg ~p2_old 2) 0) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~send3 (+ ~st2 127)) (<= ~p2_new .cse12) (<= (* 2 ~r1) 0) (<= (+ ~st3 ~p4_new 1) 0) (<= ~st2 ~send4) .cse10 (<= (+ ~alive2 256) ~p3_new) (<= .cse6 ~send2) (<= (+ ~st2 512) ~alive4))))) [2018-12-03 18:57:09,085 INFO L444 ceAbstractionStarter]: At program point L363(lines 363 370) the Hoare annotation is: (let ((.cse0 (+ ~p2_old 2)) (.cse1 (+ ~r1 1))) (and (<= 0 (+ ~st4 ~p3_old)) (<= (+ ULTIMATE.start_main_~c1~108 ~mode3) 2) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~st4 ~p2_old 1)) (<= ~p3_new ~p4_new) (<= .cse0 ~mode3) (<= ~st4 (+ ~p1_old 1)) (<= .cse0 ULTIMATE.start_main_~c1~108) (<= ~mode2 (+ ULTIMATE.start_main_~i2~108 1)) (<= (+ ~nomsg 2) ULTIMATE.start_check_~tmp~101) (<= (+ ~st2 ~mode4) 1) (<= ~p3_old (+ ULTIMATE.start_main_~i2~108 127)) (<= 2 (+ ULTIMATE.start_check_~tmp~101 ~mode1)) (<= (+ ~st3 ~p4_new 1) 0) (<= .cse1 ~mode4) (<= ~p1_new ~p4_old) (<= ~p1_old ~nomsg) (<= (+ ~mode1 ~p2_old) 0) (<= 0 (+ ~p3_new ~mode4)) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st1 1) ~mode2) (<= ULTIMATE.start_main_~i2~108 (+ ~p2_old 1)) (<= ULTIMATE.start_check_~tmp~101 .cse1) (<= 0 (+ ~st1 ~p4_old 1)) (<= (+ ~p2_new 1) ~st2) (<= (+ ~p4_old 2) ~mode2))) [2018-12-03 18:57:09,085 INFO L444 ceAbstractionStarter]: At program point L388(lines 388 389) the Hoare annotation is: false [2018-12-03 18:57:09,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 61 391) no Hoare annotation was computed. [2018-12-03 18:57:09,085 INFO L444 ceAbstractionStarter]: At program point L331(lines 324 332) the Hoare annotation is: (let ((.cse1 (+ ~p4_new 1)) (.cse0 (+ ~nomsg 2))) (and (<= ~st4 ~r1) (<= ~mode1 .cse0) (<= (+ ~st2 ~mode4) 1) (<= ~nomsg ~p2_new) (<= ~mode3 ~mode2) (<= (+ ~p1_new ~mode2) 0) (<= (+ ~p1_new 1) ~st1) (<= (+ ~r1 1) ~mode4) (<= 1 (+ ~st3 ~mode4)) (<= ~st3 .cse1) (<= .cse1 ~st2) (<= 0 (+ ~p1_new ~p3_new 1)) (<= ~p2_new ~p1_new) (<= 1 (+ ~st2 ~mode1)) (<= 1 (+ ULTIMATE.start_main_~i2~108 ~mode4)) (<= (+ ~st1 1) ~mode2) (<= .cse0 ~mode3) (<= ULTIMATE.start_main_~i2~108 ~st4) (<= (+ ULTIMATE.start_main_~i2~108 ~p3_new) 127))) [2018-12-03 18:57:09,086 INFO L444 ceAbstractionStarter]: At program point L356(lines 352 357) the Hoare annotation is: (let ((.cse0 (+ ~r1 1))) (and (<= 0 (+ ~st4 ~p3_old)) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~st4 ~p2_old 1)) (<= ~p3_new ~p4_new) (<= (+ ~p2_old 2) ~mode3) (<= ~st4 (+ ~p1_old 1)) (<= (+ ~mode3 ~mode4) 2) (<= ~mode2 (+ ULTIMATE.start_main_~i2~108 1)) (<= (+ ~nomsg 2) ULTIMATE.start_check_~tmp~101) (<= ~p3_old (+ ULTIMATE.start_main_~i2~108 127)) (<= 2 (+ ULTIMATE.start_check_~tmp~101 ~mode1)) (<= (+ ~st3 ~p4_new 1) 0) (<= .cse0 ~mode4) (<= ~p1_new ~p4_old) (<= ~p1_old ~nomsg) (<= (+ ~mode1 ~p2_old) 0) (<= 0 (+ ~p3_new ~mode4)) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st1 1) ~mode2) (<= ULTIMATE.start_main_~i2~108 (+ ~p2_old 1)) (<= ULTIMATE.start_check_~tmp~101 .cse0) (<= (+ ~st3 ~st2) 0) (<= 0 (+ ~st1 ~p4_old 1)) (<= (+ ~p2_new 1) ~st2) (<= (+ ~p4_old 2) ~mode2))) [2018-12-03 18:57:09,086 INFO L444 ceAbstractionStarter]: At program point L385(lines 244 385) the Hoare annotation is: (let ((.cse14 (+ ~p1_old 1))) (let ((.cse5 (<= ~st4 .cse14)) (.cse4 (+ ~p3_new 1)) (.cse8 (<= (+ ~st3 ~p4_new 1) 0)) (.cse7 (+ ~p4_new 1)) (.cse9 (<= (+ (* 2 ~p4_old) 2) 0))) (or (let ((.cse1 (+ ~send3 ~id1)) (.cse0 (+ ~send3 ~id2)) (.cse6 (+ ~r1 127)) (.cse3 (+ ~mode4 255)) (.cse2 (+ ~send4 ~id1))) (and (<= ~send1 ~id1) (<= ~id4 ~send4) (<= 1 .cse0) (<= (+ ~mode3 257) 0) (<= .cse1 253) (<= ~id1 ~send1) (<= ~send2 ~id2) (<= 512 ~mode2) (<= 1 (+ ~send1 ~id2)) (<= (+ ~send3 ~send4) 253) (<= ~mode4 ~mode1) (<= 1 .cse1) (<= (+ ~mode1 256) 0) (<= (+ ~send1 ~send2) 253) (<= .cse0 253) (<= ~send4 ~id4) (<= 1 .cse2) (<= ULTIMATE.start_main_~i2~108 (+ ~mode4 256)) (<= 1 (+ ~id2 ~id4)) (<= ~p3_new ~p4_new) (<= (+ (* 2 ~alive1) 514) 0) (<= (+ ~send4 ~id2) 253) (<= ~p3_old .cse3) (<= 1 (+ ~send3 ~id4)) (<= ~st1 ~st4) (<= ~id2 ~send2) (<= ~st2 .cse4) .cse5 (<= 0 (+ ~p2_old ~p4_old 2)) (<= (* 2 ~alive3) 510) (<= (+ ~send1 ~st1) 127) (<= 0 (+ ~send1 ~id1)) (<= ~p1_old ~nomsg) (<= 0 (+ ~p2_new ~st2 1)) (<= ~r1 ~send3) (<= (+ ~p1_new 1) ~r1) (<= ~id4 .cse6) (<= .cse7 ~alive3) (<= 0 (+ ~p1_new ~st3 1)) (<= ~id2 .cse6) (<= (+ ~nomsg ~p2_old 2) 0) (<= 0 (+ ULTIMATE.start_main_~i2~108 ~p1_old 1)) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~send3 (+ ~st2 127)) (<= ~p2_new .cse3) (<= (* 2 ~r1) 0) .cse8 (<= ~st2 ~send4) (<= .cse2 253) (<= (+ ~alive2 256) ~p3_new) .cse9 (<= .cse4 ~send2) (<= (+ ~st2 512) ~alive4) (<= 0 (+ ~st1 ~p4_old 1)))) (let ((.cse12 (* 2 ULTIMATE.start_assert_~arg)) (.cse11 (* 2 ULTIMATE.start_main_~c1~108)) (.cse10 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse13 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= 1 ~mode3) (<= .cse10 2) (<= .cse11 2) (<= ~mode3 ~mode1) (<= ~mode1 ~mode4) (<= 2 .cse12) (<= .cse12 2) (<= 2 .cse11) (<= 2 .cse10) (<= ~mode3 (+ ~p3_old 1)) (<= .cse13 2) (<= 2 .cse13) .cse5 (<= .cse4 ~st1) (<= 0 (+ ~p3_new ~p4_old 2)) (<= (+ ~st1 ~mode3) 1) (<= ~st4 ~r1) (<= ULTIMATE.start_main_~i2~108 (+ ~p2_old 2)) (<= ~p2_new ~p1_new) (<= 0 (+ ~p4_new ~p4_old 2)) (<= ~r1 ~st4) (<= (+ ~mode1 ~p3_old) 128) (<= ULTIMATE.start_main_~i2~108 (+ ~r1 1)) (<= ~mode4 ULTIMATE.start_main_~i2~108) (<= ULTIMATE.start_main_~i2~108 (+ ~st3 1)) (<= .cse14 ~st4) (<= ~nomsg ~p2_new) .cse8 (<= ~r1 (+ ~p2_new 1)) (<= ~p1_new ~p4_old) (<= .cse7 ~st2) (<= (+ ~mode1 ~p2_old) 0) .cse9 (<= ~st2 (+ ~nomsg 1)) (<= (+ ~p4_old 2) ~mode2)))))) [2018-12-03 18:57:09,087 INFO L444 ceAbstractionStarter]: At program point L377(lines 377 386) the Hoare annotation is: (let ((.cse0 (+ ~p2_old 2)) (.cse1 (+ ~r1 1))) (and (<= 0 (+ ~st4 ~p3_old)) (<= (+ ULTIMATE.start_main_~c1~108 ~mode3) 2) (<= (+ ~p1_old 2) ULTIMATE.start_assert_~arg) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~st4 ~p2_old 1)) (<= (+ ~p1_new ULTIMATE.start_assert_~arg) 0) (<= .cse0 ~mode3) (<= ~st4 (+ ~p1_old 1)) (<= (+ ~p3_new 1) ~st1) (<= .cse0 ULTIMATE.start_main_~c1~108) (<= ~mode2 (+ ULTIMATE.start_main_~i2~108 1)) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p4_new 2)) (<= (+ ~nomsg 2) ULTIMATE.start_check_~tmp~101) (<= (+ ~st2 ~mode4) 1) (<= ~p3_old (+ ULTIMATE.start_main_~i2~108 127)) (<= 2 (+ ULTIMATE.start_check_~tmp~101 ~mode1)) (<= (+ ~st3 ~p4_new 1) 0) (<= .cse1 ~mode4) (<= ~p1_old ~nomsg) (<= (+ ~mode1 ~p2_old) 0) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= 0 (+ ~p3_new ~mode4)) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st1 1) ~mode2) (<= ULTIMATE.start_main_~i2~108 (+ ~p2_old 1)) (<= ULTIMATE.start_check_~tmp~101 .cse1) (<= 0 (+ ~st1 ~p4_old 1)) (<= (+ ~p4_old 2) ~mode2))) [2018-12-03 18:57:09,087 INFO L444 ceAbstractionStarter]: At program point L311(lines 301 312) the Hoare annotation is: (let ((.cse12 (+ ~p1_new 1)) (.cse13 (+ ~p4_new 1)) (.cse3 (+ ~mode4 255))) (let ((.cse0 (<= ~p3_old .cse3)) (.cse1 (<= ~st3 .cse13)) (.cse2 (<= 0 (+ ~p1_new ~st3 1))) (.cse4 (<= ~nomsg ~p2_new)) (.cse5 (<= .cse12 ~st1)) (.cse6 (<= .cse13 ~st2)) (.cse7 (<= ~st2 (+ ~nomsg 1)))) (or (and (<= ~id4 ~send4) (<= (+ ~send4 ~p3_new) 253) (<= 1 (+ ~r1 ~mode3)) (<= ~send4 ~id4) (<= (+ ~mode4 256) 0) (<= ULTIMATE.start_main_~i2~108 ~r1) (<= 0 (+ ~mode2 ~mode4 255)) .cse0 (<= 0 (+ ~mode1 ~mode4 255)) .cse1 (<= ~mode1 (+ ~nomsg 2)) (<= (+ ~st1 ~mode3) 1) (<= ~st4 ~r1) .cse2 (<= ~r1 ULTIMATE.start_main_~i2~108) (<= 0 (+ ~st4 ~p3_old 1)) (<= ~p3_new (+ ~p3_old 128)) (<= ~p2_new .cse3) .cse4 (<= (+ ~p1_new ~mode2) 0) (<= ~st2 ~send4) .cse5 (<= ~r1 (+ ~p2_new 1)) .cse6 (<= 0 (+ ~p1_new ~p3_new 1)) (<= (+ ~st2 512) ~alive4) (<= ~send4 (+ ~r1 127)) .cse7) (let ((.cse10 (* 2 ULTIMATE.start_assert_~arg)) (.cse9 (* 2 ULTIMATE.start_main_~c1~108)) (.cse8 (* 2 ULTIMATE.start_check_~tmp~101)) (.cse11 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= ~mode3 ~mode4) (<= .cse8 2) (<= 0 (+ ~r1 ~p3_new)) (<= .cse9 2) (<= 2 .cse10) (<= 0 (+ ~p3_new ~p3_old 1)) (<= .cse10 2) (<= 2 .cse9) (<= 2 .cse8) (<= .cse11 2) (<= 2 .cse11) .cse0 (<= (+ ~st4 ~p4_new 1) 0) (<= ~st1 (+ ~p2_old 1)) .cse1 (<= (+ ~p3_new 1) ~st1) (<= (+ ~st2 ~mode4) 1) (<= .cse12 ~r1) .cse2 (<= 0 (+ ~st4 ~p2_old 1)) (<= ~p2_new ~p1_new) (<= (+ ~p1_new ~p3_old) 126) (<= (+ ~st2 ~p2_old 1) 0) .cse4 .cse5 (<= ~r1 (+ ~st2 1)) .cse6 .cse7))))) [2018-12-03 18:57:09,087 INFO L444 ceAbstractionStarter]: At program point L373(lines 369 374) the Hoare annotation is: (let ((.cse0 (+ ~p2_old 2)) (.cse1 (+ ~r1 1))) (and (<= 0 (+ ~st4 ~p3_old)) (<= (+ ULTIMATE.start_main_~c1~108 ~mode3) 2) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~st4 ~p2_old 1)) (<= .cse0 ~mode3) (<= ~st4 (+ ~p1_old 1)) (<= (+ ~p3_new 1) ~st1) (<= .cse0 ULTIMATE.start_main_~c1~108) (<= ~mode2 (+ ULTIMATE.start_main_~i2~108 1)) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p4_new 2)) (<= (+ ~nomsg 2) ULTIMATE.start_check_~tmp~101) (<= (+ ~st2 ~mode4) 1) (<= ~p3_old (+ ULTIMATE.start_main_~i2~108 127)) (<= 2 (+ ULTIMATE.start_check_~tmp~101 ~mode1)) (<= (+ ~st3 ~p4_new 1) 0) (<= .cse1 ~mode4) (<= ~p1_new ~p4_old) (<= ~p1_old ~nomsg) (<= (+ ~mode1 ~p2_old) 0) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= 0 (+ ~p3_new ~mode4)) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st1 1) ~mode2) (<= ULTIMATE.start_main_~i2~108 (+ ~p2_old 1)) (<= ULTIMATE.start_check_~tmp~101 .cse1) (<= (+ ~p4_old 2) ~mode2))) [2018-12-03 18:57:09,127 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:57:09 BoogieIcfgContainer [2018-12-03 18:57:09,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:57:09,128 INFO L168 Benchmark]: Toolchain (without parser) took 487920.16 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 83.4 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -41.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 18:57:09,133 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 18:57:09,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.87 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 18:57:09,134 INFO L168 Benchmark]: Boogie Preprocessor took 37.27 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 18:57:09,134 INFO L168 Benchmark]: RCFGBuilder took 659.93 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 18:57:09,138 INFO L168 Benchmark]: TraceAbstraction took 487167.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 83.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -83.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 18:57:09,142 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.20 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 49.87 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 37.27 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 659.93 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 487167.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 83.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -83.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 352]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= ~st4 + ~p3_old && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p3_new <= ~p4_new) && ~p2_old + 2 <= ~mode3) && ~st4 <= ~p1_old + 1) && ~mode3 + ~mode4 <= 2) && ~mode2 <= main_~i2~108 + 1) && ~nomsg + 2 <= check_~tmp~101) && ~p3_old <= main_~i2~108 + 127) && 2 <= check_~tmp~101 + ~mode1) && ~st3 + ~p4_new + 1 <= 0) && ~r1 + 1 <= ~mode4) && ~p1_new <= ~p4_old) && ~p1_old <= ~nomsg) && ~mode1 + ~p2_old <= 0) && 0 <= ~p3_new + ~mode4) && 0 <= ~p2_new + ~st2 + 1) && ~st1 + 1 <= ~mode2) && main_~i2~108 <= ~p2_old + 1) && check_~tmp~101 <= ~r1 + 1) && ~st3 + ~st2 <= 0) && 0 <= ~st1 + ~p4_old + 1) && ~p2_new + 1 <= ~st2) && ~p4_old + 2 <= ~mode2 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((~send1 <= ~id1 && ~id4 <= ~send4) && 1 <= ~send3 + ~id2) && ~mode3 + 257 <= 0) && ~send3 + ~id1 <= 253) && ~id1 <= ~send1) && ~send2 <= ~id2) && 512 <= ~mode2) && 1 <= ~send1 + ~id2) && ~send3 + ~send4 <= 253) && ~mode4 <= ~mode1) && 1 <= ~send3 + ~id1) && ~mode1 + 256 <= 0) && ~send1 + ~send2 <= 253) && ~send3 + ~id2 <= 253) && ~send4 <= ~id4) && 1 <= ~send4 + ~id1) && main_~i2~108 <= ~mode4 + 256) && 1 <= ~id2 + ~id4) && ~p3_new <= ~p4_new) && 2 * ~alive1 + 514 <= 0) && ~send4 + ~id2 <= 253) && ~p3_old <= ~mode4 + 255) && 1 <= ~send3 + ~id4) && ~st1 <= ~st4) && ~id2 <= ~send2) && ~st2 <= ~p3_new + 1) && ~st4 <= ~p1_old + 1) && 0 <= ~p2_old + ~p4_old + 2) && 2 * ~alive3 <= 510) && ~send1 + ~st1 <= 127) && 0 <= ~send1 + ~id1) && ~p1_old <= ~nomsg) && 0 <= ~p2_new + ~st2 + 1) && ~r1 <= ~send3) && ~p1_new + 1 <= ~r1) && ~id4 <= ~r1 + 127) && ~p4_new + 1 <= ~alive3) && 0 <= ~p1_new + ~st3 + 1) && ~id2 <= ~r1 + 127) && ~nomsg + ~p2_old + 2 <= 0) && 0 <= main_~i2~108 + ~p1_old + 1) && 0 <= ~st4 + ~p3_old + 1) && ~send3 <= ~st2 + 127) && ~p2_new <= ~mode4 + 255) && 2 * ~r1 <= 0) && ~st3 + ~p4_new + 1 <= 0) && ~st2 <= ~send4) && ~send4 + ~id1 <= 253) && ~alive2 + 256 <= ~p3_new) && 2 * ~p4_old + 2 <= 0) && ~p3_new + 1 <= ~send2) && ~st2 + 512 <= ~alive4) && 0 <= ~st1 + ~p4_old + 1) || ((((((((((((((((((((((((((((((((((1 <= ~mode3 && 2 * check_~tmp~101 <= 2) && 2 * main_~c1~108 <= 2) && ~mode3 <= ~mode1) && ~mode1 <= ~mode4) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && ~mode3 <= ~p3_old + 1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~st4 <= ~p1_old + 1) && ~p3_new + 1 <= ~st1) && 0 <= ~p3_new + ~p4_old + 2) && ~st1 + ~mode3 <= 1) && ~st4 <= ~r1) && main_~i2~108 <= ~p2_old + 2) && ~p2_new <= ~p1_new) && 0 <= ~p4_new + ~p4_old + 2) && ~r1 <= ~st4) && ~mode1 + ~p3_old <= 128) && main_~i2~108 <= ~r1 + 1) && ~mode4 <= main_~i2~108) && main_~i2~108 <= ~st3 + 1) && ~p1_old + 1 <= ~st4) && ~nomsg <= ~p2_new) && ~st3 + ~p4_new + 1 <= 0) && ~r1 <= ~p2_new + 1) && ~p1_new <= ~p4_old) && ~p4_new + 1 <= ~st2) && ~mode1 + ~p2_old <= 0) && 2 * ~p4_old + 2 <= 0) && ~st2 <= ~nomsg + 1) && ~p4_old + 2 <= ~mode2) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~st4 <= ~r1 && 0 <= ~st4 + ~p2_old + 1) && ~p2_old + 2 <= ~mode3) && 1 <= ~st3 + ~mode4) && ~p3_new + 1 <= ~st1) && ~p2_new <= ~p1_new) && 1 <= ~st2 + ~mode1) && 0 <= ~p4_new + ~p4_old + 2) && 0 <= main_~i2~108 + ~p1_old + 1) && ~p4_new + 1 <= ~p3_old) && main_~i2~108 <= ~st4) && ~p1_old + 1 <= ~st4) && ~st2 + ~mode4 <= 1) && ~nomsg <= ~p2_new) && ~p3_old <= main_~i2~108 + 127) && ~st3 + ~p4_new + 1 <= 0) && ~p1_new + ~mode2 <= 0) && ~r1 + 1 <= ~mode4) && ~p4_new + 1 <= ~st2) && ~mode1 + ~p2_old <= 0) && 0 <= ~p3_new + ~mode4) && ~mode3 + ~p4_old <= 0) && 2 * ~p4_old + 2 <= 0) && ~st1 + 1 <= ~mode2) && ~st2 <= ~nomsg + 1 - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 <= ~st4 + ~p3_old && main_~c1~108 + ~mode3 <= 2) && ~p1_old + 2 <= assert_~arg) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p1_new + assert_~arg <= 0) && ~p2_old + 2 <= ~mode3) && ~st4 <= ~p1_old + 1) && ~p3_new + 1 <= ~st1) && ~p2_old + 2 <= main_~c1~108) && ~mode2 <= main_~i2~108 + 1) && assert_#in~arg <= ~p4_new + 2) && ~nomsg + 2 <= check_~tmp~101) && ~st2 + ~mode4 <= 1) && ~p3_old <= main_~i2~108 + 127) && 2 <= check_~tmp~101 + ~mode1) && ~st3 + ~p4_new + 1 <= 0) && ~r1 + 1 <= ~mode4) && ~p1_old <= ~nomsg) && ~mode1 + ~p2_old <= 0) && ~p2_new + 2 <= assert_#in~arg) && 0 <= ~p3_new + ~mode4) && 0 <= ~p2_new + ~st2 + 1) && ~st1 + 1 <= ~mode2) && main_~i2~108 <= ~p2_old + 1) && check_~tmp~101 <= ~r1 + 1) && 0 <= ~st1 + ~p4_old + 1) && ~p4_old + 2 <= ~mode2 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((~mode3 <= ~mode4 && 2 * check_~tmp~101 <= 2) && 2 * main_~c1~108 <= 2) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && ~mode4 <= ~r1) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && ~mode3 <= ~p3_old + 1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~st3 <= ~p4_new + 1) && 0 <= 2 * ~p3_new + 2) && ~st4 <= ~p1_old + 1) && ~p3_new + 1 <= ~st1) && ~p1_old <= ~nomsg) && ~st1 + ~mode3 <= 1) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_new <= ~p1_new) && ~p1_new + ~p3_old <= 126) && ~st2 + ~p2_old + 1 <= 0) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~st2 + 1) && ~p4_new + 1 <= ~st2) && ~st1 + 1 <= ~mode2) && 1 <= ~mode3) || (((((((((((((((((((((((((((((((((((((((((~id4 <= ~send4 && ~mode4 + 256 <= 0) && 1 <= ~send3 + ~id2) && ~mode3 + 257 <= 0) && ~send2 <= ~id2) && 512 <= ~mode2) && ~send3 + ~send4 <= 253) && ~send3 + ~id2 <= 253) && ~send4 <= ~id4) && 1 <= main_~i2~108 + ~mode1) && 1 <= ~id2 + ~id4) && main_~i2~108 <= ~r1) && ~p3_new <= ~p4_new) && ~send4 + ~id2 <= 253) && ~p3_old <= ~mode4 + 255) && 1 <= ~send3 + ~id4) && ~st1 <= ~st4) && ~st2 + ~nomsg + 1 <= 0) && ~id2 <= ~send2) && ~st2 <= ~p3_new + 1) && 0 <= main_~i2~108 + ~send3) && ~mode1 <= ~nomsg + 2) && ~st4 <= ~p1_old + 1) && 2 * ~alive3 <= 510) && ~p1_old <= ~nomsg) && 0 <= ~p2_new + ~st2 + 1) && ~id4 <= ~r1 + 127) && ~p4_new + 1 <= ~alive3) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~id2 <= ~r1 + 127) && ~nomsg + ~p2_old + 2 <= 0) && 0 <= ~st4 + ~p3_old + 1) && ~send3 <= ~st2 + 127) && ~p2_new <= ~mode4 + 255) && 2 * ~r1 <= 0) && ~st3 + ~p4_new + 1 <= 0) && ~st2 <= ~send4) && ~p1_new + 1 <= ~st1) && ~alive2 + 256 <= ~p3_new) && ~p3_new + 1 <= ~send2) && ~st2 + 512 <= ~alive4) - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((~id4 <= ~send4 && ~send4 + ~p3_new <= 253) && 1 <= ~r1 + ~mode3) && ~send4 <= ~id4) && ~mode4 + 256 <= 0) && main_~i2~108 <= ~r1) && 0 <= ~mode2 + ~mode4 + 255) && ~p3_old <= ~mode4 + 255) && 0 <= ~mode1 + ~mode4 + 255) && ~st3 <= ~p4_new + 1) && ~mode1 <= ~nomsg + 2) && ~st1 + ~mode3 <= 1) && ~st4 <= ~r1) && 0 <= ~p1_new + ~st3 + 1) && ~r1 <= main_~i2~108) && 0 <= ~st4 + ~p3_old + 1) && ~p3_new <= ~p3_old + 128) && ~p2_new <= ~mode4 + 255) && ~nomsg <= ~p2_new) && ~p1_new + ~mode2 <= 0) && ~st2 <= ~send4) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~p4_new + 1 <= ~st2) && 0 <= ~p1_new + ~p3_new + 1) && ~st2 + 512 <= ~alive4) && ~send4 <= ~r1 + 127) && ~st2 <= ~nomsg + 1) || (((((((((((((((((((((((((((~mode3 <= ~mode4 && 2 * check_~tmp~101 <= 2) && 0 <= ~r1 + ~p3_new) && 2 * main_~c1~108 <= 2) && 2 <= 2 * assert_~arg) && 0 <= ~p3_new + ~p3_old + 1) && 2 * assert_~arg <= 2) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~p3_old <= ~mode4 + 255) && ~st4 + ~p4_new + 1 <= 0) && ~st1 <= ~p2_old + 1) && ~st3 <= ~p4_new + 1) && ~p3_new + 1 <= ~st1) && ~st2 + ~mode4 <= 1) && ~p1_new + 1 <= ~r1) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_new <= ~p1_new) && ~p1_new + ~p3_old <= 126) && ~st2 + ~p2_old + 1 <= 0) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~st2 + 1) && ~p4_new + 1 <= ~st2) && ~st2 <= ~nomsg + 1) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((~send1 <= ~id1 && ~id4 <= ~send4) && 1 <= ~send3 + ~id2) && ~mode3 + 257 <= 0) && ~send3 + ~id1 <= 253) && ~id1 <= ~send1) && ~send2 <= ~id2) && 512 <= ~mode2) && 1 <= ~send1 + ~id2) && ~send3 + ~send4 <= 253) && ~mode4 <= ~mode1) && 1 <= ~send3 + ~id1) && ~mode1 + 256 <= 0) && ~send1 + ~send2 <= 253) && ~send3 + ~id2 <= 253) && ~send4 <= ~id4) && 1 <= ~send4 + ~id1) && main_~i2~108 <= ~mode4 + 256) && 1 <= ~id2 + ~id4) && ~p3_new <= ~p4_new) && 2 * ~alive1 + 514 <= 0) && ~send4 + ~id2 <= 253) && ~p3_old <= ~mode4 + 255) && 1 <= ~send3 + ~id4) && ~st1 <= ~st4) && ~id2 <= ~send2) && ~st2 <= ~p3_new + 1) && ~st4 <= ~p1_old + 1) && 0 <= ~p2_old + ~p4_old + 2) && 2 * ~alive3 <= 510) && ~send1 + ~st1 <= 127) && 0 <= ~send1 + ~id1) && ~p1_old <= ~nomsg) && 0 <= ~p2_new + ~st2 + 1) && ~r1 <= ~send3) && ~p1_new + 1 <= ~r1) && ~id4 <= ~r1 + 127) && ~p4_new + 1 <= ~alive3) && 0 <= ~p1_new + ~st3 + 1) && ~id2 <= ~r1 + 127) && ~nomsg + ~p2_old + 2 <= 0) && 0 <= main_~i2~108 + ~p1_old + 1) && 0 <= ~st4 + ~p3_old + 1) && ~send3 <= ~st2 + 127) && ~p2_new <= ~mode4 + 255) && 2 * ~r1 <= 0) && ~st3 + ~p4_new + 1 <= 0) && ~st2 <= ~send4) && ~send4 + ~id1 <= 253) && ~alive2 + 256 <= ~p3_new) && 2 * ~p4_old + 2 <= 0) && ~p3_new + 1 <= ~send2) && ~st2 + 512 <= ~alive4) && 0 <= ~st1 + ~p4_old + 1) || ((((((((((((((((((((((((((((((((((1 <= ~mode3 && 2 * check_~tmp~101 <= 2) && 2 * main_~c1~108 <= 2) && ~mode3 <= ~mode1) && ~mode1 <= ~mode4) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && ~mode3 <= ~p3_old + 1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~st4 <= ~p1_old + 1) && ~p3_new + 1 <= ~st1) && 0 <= ~p3_new + ~p4_old + 2) && ~st1 + ~mode3 <= 1) && ~st4 <= ~r1) && main_~i2~108 <= ~p2_old + 2) && ~p2_new <= ~p1_new) && 0 <= ~p4_new + ~p4_old + 2) && ~r1 <= ~st4) && ~mode1 + ~p3_old <= 128) && main_~i2~108 <= ~r1 + 1) && ~mode4 <= main_~i2~108) && main_~i2~108 <= ~st3 + 1) && ~p1_old + 1 <= ~st4) && ~nomsg <= ~p2_new) && ~st3 + ~p4_new + 1 <= 0) && ~r1 <= ~p2_new + 1) && ~p1_new <= ~p4_old) && ~p4_new + 1 <= ~st2) && ~mode1 + ~p2_old <= 0) && 2 * ~p4_old + 2 <= 0) && ~st2 <= ~nomsg + 1) && ~p4_old + 2 <= ~mode2) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((((((((((((~st4 <= ~r1 && ~mode1 <= ~nomsg + 2) && ~st2 + ~mode4 <= 1) && ~nomsg <= ~p2_new) && ~mode3 <= ~mode2) && ~p1_new + ~mode2 <= 0) && ~p1_new + 1 <= ~st1) && ~r1 + 1 <= ~mode4) && 1 <= ~st3 + ~mode4) && ~st3 <= ~p4_new + 1) && ~p4_new + 1 <= ~st2) && 0 <= ~p1_new + ~p3_new + 1) && ~p2_new <= ~p1_new) && 1 <= ~st2 + ~mode1) && 1 <= main_~i2~108 + ~mode4) && ~st1 + 1 <= ~mode2) && ~nomsg + 2 <= ~mode3) && main_~i2~108 <= ~st4) && main_~i2~108 + ~p3_new <= 127 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= ~st4 + ~p3_old && main_~c1~108 + ~mode3 <= 2) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p3_new <= ~p4_new) && ~p2_old + 2 <= ~mode3) && ~st4 <= ~p1_old + 1) && ~p2_old + 2 <= main_~c1~108) && ~mode2 <= main_~i2~108 + 1) && ~nomsg + 2 <= check_~tmp~101) && ~st2 + ~mode4 <= 1) && ~p3_old <= main_~i2~108 + 127) && 2 <= check_~tmp~101 + ~mode1) && ~st3 + ~p4_new + 1 <= 0) && ~r1 + 1 <= ~mode4) && ~p1_new <= ~p4_old) && ~p1_old <= ~nomsg) && ~mode1 + ~p2_old <= 0) && 0 <= ~p3_new + ~mode4) && 0 <= ~p2_new + ~st2 + 1) && ~st1 + 1 <= ~mode2) && main_~i2~108 <= ~p2_old + 1) && check_~tmp~101 <= ~r1 + 1) && 0 <= ~st1 + ~p4_old + 1) && ~p2_new + 1 <= ~st2) && ~p4_old + 2 <= ~mode2 - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= ~st4 + ~p3_old && main_~c1~108 + ~mode3 <= 2) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_old + 2 <= ~mode3) && ~st4 <= ~p1_old + 1) && ~p3_new + 1 <= ~st1) && ~p2_old + 2 <= main_~c1~108) && ~mode2 <= main_~i2~108 + 1) && assert_#in~arg <= ~p4_new + 2) && ~nomsg + 2 <= check_~tmp~101) && ~st2 + ~mode4 <= 1) && ~p3_old <= main_~i2~108 + 127) && 2 <= check_~tmp~101 + ~mode1) && ~st3 + ~p4_new + 1 <= 0) && ~r1 + 1 <= ~mode4) && ~p1_new <= ~p4_old) && ~p1_old <= ~nomsg) && ~mode1 + ~p2_old <= 0) && ~p2_new + 2 <= assert_#in~arg) && 0 <= ~p3_new + ~mode4) && 0 <= ~p2_new + ~st2 + 1) && ~st1 + 1 <= ~mode2) && main_~i2~108 <= ~p2_old + 1) && check_~tmp~101 <= ~r1 + 1) && ~p4_old + 2 <= ~mode2 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((~id4 <= ~send4 && ~mode4 + 256 <= 0) && ~mode3 + 257 <= 0) && ~send3 + ~send4 <= 253) && ~send4 <= ~id4) && main_~i2~108 <= ~r1) && 0 <= ~mode2 + ~mode4 + 255) && ~p3_new <= ~p4_new) && ~p3_old <= ~mode4 + 255) && 1 <= ~send3 + ~id4) && 0 <= ~mode1 + ~mode4 + 255) && ~st1 <= ~st4) && ~st4 <= ~p2_old + 1) && 0 <= main_~i2~108 + ~send3) && ~mode1 <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~mode2 <= main_~i2~108 + 1) && 2 * ~alive3 <= 510) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st2 <= 0) && ~id4 <= ~r1 + 127) && ~p4_new + 1 <= ~alive3) && 0 <= ~p1_new + ~st3 + 1) && ~nomsg + ~p2_old + 2 <= 0) && 0 <= ~st4 + ~p3_old + 1) && ~send3 <= ~st2 + 127) && ~p2_new <= ~mode4 + 255) && 2 * ~r1 <= 0) && ~st3 + ~p4_new + 1 <= 0) && ~st2 <= ~send4) && ~p1_new + 1 <= ~st1) && ~st2 + 512 <= ~alive4) || (((((((((((((((((((((((((~mode3 <= ~mode4 && 2 * check_~tmp~101 <= 2) && 2 * main_~c1~108 <= 2) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && ~mode4 <= ~r1) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && ~mode3 <= ~p3_old + 1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~st4 + ~p4_new + 1 <= 0) && ~st3 <= ~p4_new + 1) && 0 <= 2 * ~p3_new + 2) && ~p3_new + 1 <= ~st1) && ~st1 + ~mode3 <= 1) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_new <= ~p1_new) && ~p1_new + ~p3_old <= 126) && ~st2 + ~p2_old + 1 <= 0) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~st2 + 1) && ~st2 <= ~nomsg + 1) && 1 <= ~mode3) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((~mode3 <= ~mode4 && 2 * check_~tmp~101 <= 2) && 2 * main_~c1~108 <= 2) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && ~mode4 <= ~r1) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && ~mode3 <= ~p3_old + 1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~st3 <= ~p4_new + 1) && 0 <= 2 * ~p3_new + 2) && ~st4 <= ~p1_old + 1) && ~p3_new + 1 <= ~st1) && ~p1_old <= ~nomsg) && ~st1 + ~mode3 <= 1) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_new <= ~p1_new) && ~p1_new + ~p3_old <= 126) && ~st2 + ~p2_old + 1 <= 0) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~st2 + 1) && ~p4_new + 1 <= ~st2) && ~st1 + 1 <= ~mode2) && 1 <= ~mode3) || (((((((((((((((((((((((((((((((((((((((((~id4 <= ~send4 && ~mode4 + 256 <= 0) && 1 <= ~send3 + ~id2) && ~mode3 + 257 <= 0) && ~send2 <= ~id2) && 512 <= ~mode2) && ~send3 + ~send4 <= 253) && ~send3 + ~id2 <= 253) && ~send4 <= ~id4) && 1 <= main_~i2~108 + ~mode1) && 1 <= ~id2 + ~id4) && main_~i2~108 <= ~r1) && ~p3_new <= ~p4_new) && ~send4 + ~id2 <= 253) && ~p3_old <= ~mode4 + 255) && 1 <= ~send3 + ~id4) && ~st1 <= ~st4) && ~st2 + ~nomsg + 1 <= 0) && ~id2 <= ~send2) && ~st2 <= ~p3_new + 1) && 0 <= main_~i2~108 + ~send3) && ~mode1 <= ~nomsg + 2) && ~st4 <= ~p1_old + 1) && 2 * ~alive3 <= 510) && ~p1_old <= ~nomsg) && 0 <= ~p2_new + ~st2 + 1) && ~id4 <= ~r1 + 127) && ~p4_new + 1 <= ~alive3) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~id2 <= ~r1 + 127) && ~nomsg + ~p2_old + 2 <= 0) && 0 <= ~st4 + ~p3_old + 1) && ~send3 <= ~st2 + 127) && ~p2_new <= ~mode4 + 255) && 2 * ~r1 <= 0) && ~st3 + ~p4_new + 1 <= 0) && ~st2 <= ~send4) && ~p1_new + 1 <= ~st1) && ~alive2 + 256 <= ~p3_new) && ~p3_new + 1 <= ~send2) && ~st2 + 512 <= ~alive4) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((~id4 <= ~send4 && ~send4 + ~p3_new <= 253) && 1 <= ~r1 + ~mode3) && ~send4 <= ~id4) && ~mode4 + 256 <= 0) && main_~i2~108 <= ~r1) && 0 <= ~mode2 + ~mode4 + 255) && ~p3_old <= ~mode4 + 255) && 0 <= ~mode1 + ~mode4 + 255) && ~st3 <= ~p4_new + 1) && ~mode1 <= ~nomsg + 2) && ~st1 + ~mode3 <= 1) && ~st4 <= ~r1) && 0 <= ~p1_new + ~st3 + 1) && ~r1 <= main_~i2~108) && 0 <= ~st4 + ~p3_old + 1) && ~p3_new <= ~p3_old + 128) && ~p2_new <= ~mode4 + 255) && ~nomsg <= ~p2_new) && ~p1_new + ~mode2 <= 0) && ~st2 <= ~send4) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~p4_new + 1 <= ~st2) && 0 <= ~p1_new + ~p3_new + 1) && ~st2 + 512 <= ~alive4) && ~send4 <= ~r1 + 127) && ~st2 <= ~nomsg + 1) || (((((((((((((((((((((((((((~mode3 <= ~mode4 && 2 * check_~tmp~101 <= 2) && 0 <= ~r1 + ~p3_new) && 2 * main_~c1~108 <= 2) && 2 <= 2 * assert_~arg) && 0 <= ~p3_new + ~p3_old + 1) && 2 * assert_~arg <= 2) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~p3_old <= ~mode4 + 255) && ~st4 + ~p4_new + 1 <= 0) && ~st1 <= ~p2_old + 1) && ~st3 <= ~p4_new + 1) && ~p3_new + 1 <= ~st1) && ~st2 + ~mode4 <= 1) && ~p1_new + 1 <= ~r1) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_new <= ~p1_new) && ~p1_new + ~p3_old <= 126) && ~st2 + ~p2_old + 1 <= 0) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~st2 + 1) && ~p4_new + 1 <= ~st2) && ~st2 <= ~nomsg + 1) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((~id4 <= ~send4 && ~mode4 + 256 <= 0) && ~mode3 + 257 <= 0) && ~send3 + ~send4 <= 253) && ~send4 <= ~id4) && main_~i2~108 <= ~r1) && 0 <= ~mode2 + ~mode4 + 255) && ~p3_new <= ~p4_new) && ~p3_old <= ~mode4 + 255) && 1 <= ~send3 + ~id4) && 0 <= ~mode1 + ~mode4 + 255) && ~st1 <= ~st4) && ~st4 <= ~p2_old + 1) && 0 <= main_~i2~108 + ~send3) && ~mode1 <= ~nomsg + 2) && ~mode2 <= ~p3_new + 2) && ~mode2 <= main_~i2~108 + 1) && 2 * ~alive3 <= 510) && 0 <= ~p2_new + ~st2 + 1) && ~st3 + ~st2 <= 0) && ~id4 <= ~r1 + 127) && ~p4_new + 1 <= ~alive3) && 0 <= ~p1_new + ~st3 + 1) && ~nomsg + ~p2_old + 2 <= 0) && 0 <= ~st4 + ~p3_old + 1) && ~send3 <= ~st2 + 127) && ~p2_new <= ~mode4 + 255) && 2 * ~r1 <= 0) && ~st3 + ~p4_new + 1 <= 0) && ~st2 <= ~send4) && ~p1_new + 1 <= ~st1) && ~st2 + 512 <= ~alive4) || (((((((((((((((((((((((((~mode3 <= ~mode4 && 2 * check_~tmp~101 <= 2) && 2 * main_~c1~108 <= 2) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && ~mode4 <= ~r1) && 2 <= 2 * main_~c1~108) && 2 <= 2 * check_~tmp~101) && ~mode3 <= ~p3_old + 1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~st4 + ~p4_new + 1 <= 0) && ~st3 <= ~p4_new + 1) && 0 <= 2 * ~p3_new + 2) && ~p3_new + 1 <= ~st1) && ~st1 + ~mode3 <= 1) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~st4 + ~p2_old + 1) && ~p2_new <= ~p1_new) && ~p1_new + ~p3_old <= 126) && ~st2 + ~p2_old + 1 <= 0) && ~nomsg <= ~p2_new) && ~p1_new + 1 <= ~st1) && ~r1 <= ~st2 + 1) && ~st2 <= ~nomsg + 1) && 1 <= ~mode3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 487.0s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 30.6s AutomataDifference, 0.0s DeadEndRemovalTime, 438.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 208 SDtfs, 294 SDslu, 304 SDs, 0 SdLazy, 436 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9822533788051031 AbsIntWeakeningRatio, 1.8620689655172413 AbsIntAvgWeakeningVarsNumRemoved, 1970.6206896551723 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 93 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 37 NumberOfFragments, 3368 HoareAnnotationTreeSize, 15 FomulaSimplifications, 198 FormulaSimplificationTreeSizeReduction, 24.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 88836 FormulaSimplificationTreeSizeReductionInter, 414.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 8391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 54/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...