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.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:48:15,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:48:15,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:48:15,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:48:15,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:48:15,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:48:15,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:48:15,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:48:15,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:48:15,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:48:15,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:48:15,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:48:15,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:48:15,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:48:15,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:48:15,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:48:15,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:48:15,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:48:15,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:48:15,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:48:15,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:48:15,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:48:15,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:48:15,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:48:15,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:48:15,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:48:15,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:48:15,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:48:15,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:48:15,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:48:15,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:48:15,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:48:15,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:48:15,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:48:15,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:48:15,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:48:15,206 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:48:15,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:48:15,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:48:15,235 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:48:15,235 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:48:15,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:48:15,235 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:48:15,236 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:48:15,236 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:48:15,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:48:15,236 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:48:15,236 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:48:15,237 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:48:15,237 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:48:15,237 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:48:15,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:48:15,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:48:15,238 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:48:15,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:48:15,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:48:15,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:48:15,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:48:15,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:48:15,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:48:15,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:48:15,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:48:15,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:48:15,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:48:15,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:48:15,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:48:15,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:48:15,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:48:15,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:48:15,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:48:15,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:48:15,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:48:15,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:48:15,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:48:15,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:48:15,245 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:48:15,245 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:48:15,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:48:15,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:48:15,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:48:15,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:48:15,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:48:15,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 18:48:15,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-12-03 18:48:15,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:48:15,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:48:15,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:48:15,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:48:15,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:48:15,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:48:15,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:48:15,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:48:15,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:48:15,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/1) ... [2018-12-03 18:48:15,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:48:15,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:48:15,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:48:15,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:48:15,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (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:48:15,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:48:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:48:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:48:16,082 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:48:16,083 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:48:16,083 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:48:16 BoogieIcfgContainer [2018-12-03 18:48:16,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:48:16,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:48:16,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:48:16,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:48:16,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:48:15" (1/2) ... [2018-12-03 18:48:16,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6e87f and model type pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:48:16, skipping insertion in model container [2018-12-03 18:48:16,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:48:16" (2/2) ... [2018-12-03 18:48:16,094 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 18:48:16,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:48:16,115 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:48:16,133 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:48:16,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:48:16,171 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:48:16,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:48:16,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:48:16,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:48:16,171 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:48:16,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:48:16,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:48:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 18:48:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:48:16,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:16,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:48:16,212 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:16,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 18:48:16,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:16,470 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:48:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:48:16,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:16,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:48:16,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:48:16,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:48:16,496 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2018-12-03 18:48:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:16,636 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2018-12-03 18:48:16,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:48:16,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 18:48:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:16,652 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:48:16,652 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:48:16,655 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:48:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:48:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2018-12-03 18:48:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:48:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-03 18:48:16,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-12-03 18:48:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:16,699 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-03 18:48:16,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:48:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-12-03 18:48:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:48:16,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:16,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:48:16,700 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:16,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1823086613, now seen corresponding path program 1 times [2018-12-03 18:48:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:16,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:16,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:16,815 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:48:16,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:16,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:48:16,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:16,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:48:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:48:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:48:16,819 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-12-03 18:48:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:17,004 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-12-03 18:48:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:48:17,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 18:48:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:17,006 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:48:17,006 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:48:17,007 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:48:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:48:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 18:48:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:48:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-03 18:48:17,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2018-12-03 18:48:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:17,014 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-03 18:48:17,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:48:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-03 18:48:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:48:17,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:17,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:48:17,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:17,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1765828311, now seen corresponding path program 1 times [2018-12-03 18:48:17,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,104 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:48:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:48:17,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:17,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:48:17,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:48:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:48:17,107 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 3 states. [2018-12-03 18:48:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:17,131 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-12-03 18:48:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:48:17,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 18:48:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:17,133 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:48:17,133 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:48:17,133 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:48:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:48:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:48:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:48:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-03 18:48:17,142 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 14 [2018-12-03 18:48:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:17,143 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-03 18:48:17,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:48:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-03 18:48:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:48:17,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:17,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:48:17,144 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:17,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2023993749, now seen corresponding path program 1 times [2018-12-03 18:48:17,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,196 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:48:17,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:48:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:48:17,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:48:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:48:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:48:17,198 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-12-03 18:48:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:17,228 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-12-03 18:48:17,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:48:17,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 18:48:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:17,230 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:48:17,230 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:48:17,231 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:48:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:48:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:48:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:48:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-03 18:48:17,249 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2018-12-03 18:48:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:17,250 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-03 18:48:17,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:48:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-03 18:48:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:48:17,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:17,254 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:48:17,254 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:17,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 550402615, now seen corresponding path program 1 times [2018-12-03 18:48:17,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:17,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:48:17,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:17,440 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 18:48:17,442 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [16], [18], [22], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 18:48:17,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:48:17,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:48:18,163 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:48:20,497 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:48:20,498 INFO L272 AbstractInterpreter]: Visited 17 different actions 38 times. Merged at 13 different actions 17 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:48:20,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:20,510 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:48:21,489 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 52.32% of their original sizes. [2018-12-03 18:48:21,490 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:48:27,461 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-03 18:48:27,461 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:48:27,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:48:27,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 24 [2018-12-03 18:48:27,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:27,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:48:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:48:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:48:27,466 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 21 states. [2018-12-03 18:48:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:43,116 INFO L93 Difference]: Finished difference Result 136 states and 176 transitions. [2018-12-03 18:48:43,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:48:43,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-12-03 18:48:43,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:43,119 INFO L225 Difference]: With dead ends: 136 [2018-12-03 18:48:43,119 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 18:48:43,121 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:48:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 18:48:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 47. [2018-12-03 18:48:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:48:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-12-03 18:48:43,238 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 26 [2018-12-03 18:48:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:43,239 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-03 18:48:43,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:48:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-12-03 18:48:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:48:43,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:43,240 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:48:43,241 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:43,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash 943429625, now seen corresponding path program 1 times [2018-12-03 18:48:43,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:43,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:43,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:43,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:43,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:48:43,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:43,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:43,381 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 18:48:43,381 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 18:48:43,384 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:48:43,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:48:43,647 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:48:45,038 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:48:45,039 INFO L272 AbstractInterpreter]: Visited 18 different actions 40 times. Merged at 13 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:48:45,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:45,048 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:48:45,500 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.25% of their original sizes. [2018-12-03 18:48:45,501 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:48:50,652 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-03 18:48:50,653 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:48:50,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:48:50,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [4] total 24 [2018-12-03 18:48:50,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:48:50,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:48:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:48:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:48:50,655 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 22 states. [2018-12-03 18:49:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:09,095 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2018-12-03 18:49:09,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:49:09,095 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-03 18:49:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:09,097 INFO L225 Difference]: With dead ends: 131 [2018-12-03 18:49:09,097 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 18:49:09,098 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:49:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 18:49:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 59. [2018-12-03 18:49:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 18:49:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-03 18:49:09,247 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 26 [2018-12-03 18:49:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:09,247 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-03 18:49:09,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:49:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-03 18:49:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:49:09,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:09,249 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:09,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:09,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash 636968921, now seen corresponding path program 2 times [2018-12-03 18:49:09,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:09,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:09,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 18:49:09,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:49:09,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:49:09,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:09,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:49:09,310 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2018-12-03 18:49:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:09,508 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2018-12-03 18:49:09,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:09,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 18:49:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:09,510 INFO L225 Difference]: With dead ends: 107 [2018-12-03 18:49:09,510 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 18:49:09,511 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:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 18:49:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-12-03 18:49:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:49:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-12-03 18:49:09,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 38 [2018-12-03 18:49:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:09,711 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-12-03 18:49:09,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-12-03 18:49:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:49:09,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:09,712 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:49:09,713 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:09,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:09,713 INFO L82 PathProgramCache]: Analyzing trace with hash 895982425, now seen corresponding path program 2 times [2018-12-03 18:49:09,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:09,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:09,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 18:49:09,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:09,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:09,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:09,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:09,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:09,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:09,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:09,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:09,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:49:09,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:09,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 18:49:10,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 18:49:10,210 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:49:10,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-12-03 18:49:10,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:10,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:10,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:49:10,214 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 3 states. [2018-12-03 18:49:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:10,534 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2018-12-03 18:49:10,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:10,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 18:49:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:10,536 INFO L225 Difference]: With dead ends: 121 [2018-12-03 18:49:10,536 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:49:10,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:49:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:49:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 18:49:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 18:49:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-12-03 18:49:10,767 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 38 [2018-12-03 18:49:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:10,767 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-12-03 18:49:10,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-12-03 18:49:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:49:10,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:10,769 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:10,769 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:10,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1151773895, now seen corresponding path program 3 times [2018-12-03 18:49:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:10,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:10,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 18:49:10,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:10,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:10,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:10,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:10,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:10,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:11,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:11,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:11,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:11,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:11,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 18:49:11,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 18:49:11,382 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:49:11,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-12-03 18:49:11,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:49:11,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:49:11,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:49:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:49:11,387 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 3 states. [2018-12-03 18:49:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:11,537 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-03 18:49:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:49:11,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 18:49:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:11,538 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:49:11,539 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:49:11,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:49:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:49:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:49:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:49:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:49:11,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 18:49:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:11,548 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:49:11,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:49:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:49:11,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:49:11,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:49:15,606 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 924 DAG size of output: 924 [2018-12-03 18:49:21,496 WARN L180 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 1415 DAG size of output: 1415 [2018-12-03 18:49:25,704 WARN L180 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 1524 DAG size of output: 1521 [2018-12-03 18:49:27,489 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 1110 [2018-12-03 18:49:33,043 WARN L180 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 1945 DAG size of output: 1943 [2018-12-03 18:49:34,766 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 924 DAG size of output: 924 [2018-12-03 18:49:36,551 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 1110 [2018-12-03 18:49:41,724 WARN L180 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 1540 DAG size of output: 1532 [2018-12-03 18:49:45,402 WARN L180 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 1527 DAG size of output: 1527 [2018-12-03 18:49:51,635 WARN L180 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 1945 DAG size of output: 1943 [2018-12-03 18:49:53,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:49:57,786 WARN L180 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 1544 DAG size of output: 1537 [2018-12-03 18:49:59,565 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 936 DAG size of output: 936 [2018-12-03 18:50:13,439 WARN L180 SmtUtils]: Spent 13.87 s on a formula simplification. DAG size of input: 924 DAG size of output: 88 [2018-12-03 18:50:26,238 WARN L180 SmtUtils]: Spent 12.79 s on a formula simplification. DAG size of input: 1415 DAG size of output: 85 [2018-12-03 18:50:40,499 WARN L180 SmtUtils]: Spent 14.25 s on a formula simplification. DAG size of input: 1521 DAG size of output: 94 [2018-12-03 18:51:21,581 WARN L180 SmtUtils]: Spent 41.08 s on a formula simplification. DAG size of input: 1110 DAG size of output: 123 [2018-12-03 18:52:09,165 WARN L180 SmtUtils]: Spent 47.57 s on a formula simplification. DAG size of input: 1942 DAG size of output: 170 [2018-12-03 18:52:22,563 WARN L180 SmtUtils]: Spent 13.39 s on a formula simplification. DAG size of input: 924 DAG size of output: 88 [2018-12-03 18:53:03,848 WARN L180 SmtUtils]: Spent 41.28 s on a formula simplification. DAG size of input: 1110 DAG size of output: 123 [2018-12-03 18:53:40,048 WARN L180 SmtUtils]: Spent 36.19 s on a formula simplification. DAG size of input: 1532 DAG size of output: 94 [2018-12-03 18:54:30,774 WARN L180 SmtUtils]: Spent 50.72 s on a formula simplification. DAG size of input: 1527 DAG size of output: 90 [2018-12-03 18:55:18,585 WARN L180 SmtUtils]: Spent 47.80 s on a formula simplification. DAG size of input: 1942 DAG size of output: 170 [2018-12-03 18:55:47,978 WARN L180 SmtUtils]: Spent 29.39 s on a formula simplification. DAG size of input: 1535 DAG size of output: 101 [2018-12-03 18:56:11,149 WARN L180 SmtUtils]: Spent 23.17 s on a formula simplification. DAG size of input: 936 DAG size of output: 79 [2018-12-03 18:56:11,153 INFO L444 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse33 (+ ~p3_new 1)) (.cse34 (+ ~id2 ~id3))) (let ((.cse0 (<= ~send2 ~id2)) (.cse1 (<= (+ ~alive3 ~p1_old) 254)) (.cse2 (<= ~send3 ~id3)) (.cse3 (<= ~id3 ~send3)) (.cse4 (<= ~mode2 ULTIMATE.start_main_~i2~84)) (.cse5 (<= (+ ~p1_new ~id2) 253)) (.cse6 (<= (+ ~p1_new ~mode3) 0)) (.cse7 (<= (+ ~alive2 ~mode3 255) 0)) (.cse8 (<= 1 .cse34)) (.cse9 (<= 1 (+ ~r1 ~mode1))) (.cse10 (<= (+ ~p1_new ~send3) 253)) (.cse11 (<= (+ ~p1_new ~p1_old) 126)) (.cse17 (+ ~p2_new 1)) (.cse12 (<= 0 (+ ~st3 ~st2))) (.cse13 (<= ~id2 ~send2)) (.cse14 (<= 0 (+ (* 2 ~p3_new) 2))) (.cse15 (<= .cse33 ~st1)) (.cse16 (<= .cse34 253)) (.cse18 (<= 0 (+ ~alive2 ~p3_new 257))) (.cse19 (<= ~id2 (+ ~r1 127))) (.cse20 (<= (+ ~alive3 ~mode3) 1)) (.cse21 (<= (* 2 ~st3) 0)) (.cse22 (<= ~send3 (+ ~st2 127))) (.cse23 (<= ~nomsg ~p2_new)) (.cse24 (<= .cse33 ~alive3)) (.cse25 (<= ~st1 ~id3)) (.cse26 (<= .cse33 ~send2)) (.cse27 (<= ~st2 (+ ~nomsg 1))) (.cse28 (<= (+ ~r1 ~alive2 1) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p3_new ~p1_old) .cse12 .cse13 (<= ~mode1 (+ ~nomsg 2)) .cse14 (<= ~st1 ~mode2) .cse15 .cse16 (<= .cse17 ULTIMATE.start_main_~i2~84) .cse18 .cse19 .cse20 .cse21 (<= ULTIMATE.start_main_~i2~84 ~r1) .cse22 .cse23 (<= (* 2 ~r1) 0) (<= 0 (+ ~p1_new ~p3_new 1)) .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse29 (* 2 ULTIMATE.start_main_~c1~84)) (.cse31 (* 2 ULTIMATE.start_assert_~arg)) (.cse30 (* 2 ULTIMATE.start_check_~tmp~77)) (.cse32 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= .cse29 2) .cse0 (<= 2 .cse30) (<= 2 .cse29) .cse1 .cse2 .cse3 .cse4 (<= 2 .cse31) (<= .cse31 2) (<= .cse30 2) (<= (+ ~p1_old ~id3) 253) .cse5 .cse6 (<= ~mode2 (+ ~p1_old 1)) .cse7 .cse8 .cse9 (<= .cse32 2) (<= 2 .cse32) .cse10 .cse11 (<= (+ ULTIMATE.start_main_~i2~84 ~mode1) 1) (<= .cse17 ~st2) (<= ~r1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~mode2) .cse12 .cse13 .cse14 .cse15 (<= ~st1 ~mode1) .cse16 (<= 0 (+ ~p1_new ~r1)) .cse18 (<= (* 2 ~st2) 0) .cse19 .cse20 .cse21 (<= ~st1 ULTIMATE.start_main_~i2~84) .cse22 (<= (+ ~r1 ~send2) 128) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28))))) [2018-12-03 18:56:11,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-12-03 18:56:11,154 INFO L444 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (let ((.cse2 (+ ~alive2 ~nomsg 257)) (.cse1 (+ ~alive2 256)) (.cse0 (+ ~alive3 ~alive2 256)) (.cse3 (+ ~alive2 257))) (and (<= (+ ~p1_new ~alive2 257) 0) (<= (+ ULTIMATE.start_main_~i2~84 ~alive2 256) 0) (<= (+ ~alive2 ULTIMATE.start_check_~tmp~77 255) 0) (<= 0 .cse0) (<= (+ ~p2_new ~alive2 257) 0) (<= 0 (+ ~p1_old ~p3_new 1)) (<= ~st1 .cse1) (<= 1 (+ ~send2 ~id3)) (<= 0 (+ ~p3_new ~st1 1)) (<= 0 (+ ~alive2 ~p3_old 257)) (<= (+ ~p1_old ~id3) 253) (<= ~r1 .cse1) (<= (+ ~st3 ~p3_new 1) 0) (<= .cse1 ~st2) (<= ~mode1 (+ ~p2_new 2)) (<= (+ ~p1_old ULTIMATE.start_check_~tmp~77) 128) (<= .cse1 ~send3) (<= (+ ~id2 ~id3) 253) (<= ~send2 ~id2) (<= ~st2 .cse1) (<= ~send3 ~id3) (<= (+ ~send3 ~alive2 129) 0) (<= .cse1 ULTIMATE.start_main_~i2~84) (<= ~mode2 (+ ~p1_new 2)) (<= 0 .cse2) (<= .cse2 0) (<= (+ ~p2_new ~send2) 126) (<= .cse3 ~mode1) (<= .cse1 ~st3) (<= ~id3 ~send3) (<= 1 ULTIMATE.start_check_~tmp~77) (<= .cse0 0) (<= (+ ~p3_old 2) ~mode3) (<= 0 (+ ~r1 ~alive2 256)) (<= .cse3 ~mode2) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)) (<= ~mode3 .cse3))) [2018-12-03 18:56:11,154 INFO L444 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (let ((.cse0 (+ ~p2_new 1)) (.cse1 (+ ~p3_new 1))) (and (<= .cse0 ULTIMATE.start_main_~i2~84) (<= (+ ~alive3 ~mode3) 1) (<= 1 (+ ~send2 ~id3)) (<= (* 2 ~st3) 0) (<= ~r1 (+ ~alive2 256)) (<= ~alive3 (+ ~st1 255)) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~st2) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ~mode1 ~nomsg) 0) (<= (+ ~p1_new ~send3) 253) (<= (+ ~p1_new ~id2) 253) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (* 2 ~p1_new) 254) (<= (+ ~id2 ~id3) 253) (<= 2 (+ ~mode1 ~mode2)) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (+ ~nomsg ~mode2) 0) (<= (+ ~p1_new ~mode3) 0) (<= ~r1 .cse0) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ (* 2 ~p3_new) 2) 0) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new ~send2) 126) (<= ~st2 ~st3) (<= 0 (+ ~p1_new ~p3_new 1)) (<= .cse1 ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= ULTIMATE.start_main_~i2~84 .cse1) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 18:56:11,155 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 310) the Hoare annotation is: (let ((.cse0 (+ ~p3_old 2)) (.cse1 (+ ~id2 ~id3))) (and (<= 2 (+ ~mode1 ~mode3)) (<= ~mode1 (+ ~nomsg 2)) (<= |ULTIMATE.start_assert_#in~arg| .cse0) (<= 0 (+ ~p1_new ~st3 1)) (<= (+ ~p1_new ULTIMATE.start_assert_~arg) 0) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= ~id2 (+ ~r1 127)) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= ~mode2 (+ ~p3_new 2)) (<= (+ ~p3_new 1) ~st1) (<= (+ ~p1_old ~id3) 253) (<= .cse0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_main_~c1~84 ~mode1) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (<= (* 2 ~p1_old) 254) (<= (+ ~nomsg ~p3_old 2) 0) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= ~mode2 ULTIMATE.start_main_~c1~84) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse1 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (* 2 ~r1) 0) (<= 0 (+ ~alive2 ~nomsg 257)) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= 1 (+ ULTIMATE.start_assert_~arg ~id3)) (<= ~id3 ~send3) (<= 1 .cse1) (<= 0 (+ ~p2_new ~st2 1)) (<= (+ ~st1 1) ~mode2) (<= (+ ~p1_new 1) ~r1) (<= (+ |ULTIMATE.start_assert_#in~arg| ~alive2 255) 0) (<= (+ ~st3 ~st2) 0) (<= |ULTIMATE.start_assert_#in~arg| (+ ~alive3 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 18:56:11,155 INFO L444 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (let ((.cse1 (+ ~id2 ~id3)) (.cse0 (+ ~nomsg 2))) (and (<= ~mode1 .cse0) (<= |ULTIMATE.start_assert_#in~arg| (+ ~p3_old 2)) (<= (+ ~p3_old 1) ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= 0 (+ ~p1_old ~p3_new 1)) (<= (+ ~alive3 ~mode3) 1) (<= ~mode2 (+ ~p3_new 2)) (<= (* 2 ~st3) 0) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= ~r1 (+ ~alive2 256)) (<= (+ ~p1_old ~id3) 253) (<= ULTIMATE.start_main_~c1~84 ~mode1) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse1 253) (<= ~send2 ~id2) (<= ~nomsg ~p2_new) (<= ~send3 ~id3) (<= |ULTIMATE.start_assert_#in~arg| (+ ~r1 1)) (<= (+ ~p1_new 1) ~st1) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send2 ULTIMATE.start_check_~tmp~77) 128) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new 2) |ULTIMATE.start_assert_#in~arg|) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse1) (<= (+ ~st1 1) ~mode2) (<= .cse0 ~mode3) (<= (+ ULTIMATE.start_main_~c1~84 ~p1_old) 128) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 18:56:11,156 INFO L444 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse6 (+ ~p3_new 1)) (.cse21 (+ ~id2 ~id3)) (.cse7 (+ ~nomsg 1)) (.cse11 (+ ~p2_new 1))) (let ((.cse0 (<= ~send2 ~id2)) (.cse2 (let ((.cse22 (<= ~send3 ~id3)) (.cse23 (<= ~id3 ~send3)) (.cse24 (<= ~r1 .cse11)) (.cse25 (<= ~st2 .cse7))) (or (and .cse22 .cse23 (<= (+ ~mode1 255) ~p3_new) (<= ULTIMATE.start_main_~i2~84 ~st2) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ~p3_new ~mode3 258) 0) (<= 0 (+ ~p1_old ~p3_old 2)) .cse24 .cse25 (<= (+ ~p1_old ~mode2 1) 0)) (and .cse22 .cse23 (<= (+ ~p1_old ~id3) 253) (<= 1 (+ ~st2 ~mode1)) (<= (+ ~nomsg 2) ~mode3) (<= (+ ULTIMATE.start_main_~i2~84 ~p1_old) 128) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~p1_old ~p3_new 1)) .cse24 .cse25)))) (.cse3 (<= 1 .cse21)) (.cse4 (<= (+ ~mode2 ~p3_old) 0)) (.cse8 (<= ~id2 ~send2)) (.cse9 (<= .cse21 253)) (.cse13 (+ ~alive2 256)) (.cse10 (<= (+ ~st1 ~mode3) 1)) (.cse12 (<= ~id2 (+ ~r1 127))) (.cse14 (<= ~mode2 (+ ~st1 1))) (.cse16 (<= .cse6 ~send2))) (or (let ((.cse1 (+ ~send1 ~send2)) (.cse5 (+ ~send1 ~st1)) (.cse15 (+ ~mode1 256))) (and .cse0 (and (<= (+ ~send1 ~send3) 253) (<= 1 .cse1)) (<= .cse1 253) (<= ~mode1 0) (<= 1 (+ ~send1 ~id3)) .cse2 .cse3 (<= 0 (+ ~alive3 ULTIMATE.start_main_~i2~84)) .cse4 (<= (+ ~p3_old 1) ~mode2) (<= 0 .cse5) (<= .cse6 ~mode2) (<= 0 (+ ~st3 ULTIMATE.start_main_~i2~84)) (<= (+ ~p1_new 1) ULTIMATE.start_main_~i2~84) (<= .cse7 ULTIMATE.start_main_~i2~84) .cse8 (<= ~id3 (+ ~mode2 127)) (<= (+ ULTIMATE.start_main_~i2~84 256) ~alive1) (<= 0 (+ ~p1_new ~mode2 1)) .cse9 (<= .cse5 127) .cse10 (<= .cse11 ULTIMATE.start_main_~i2~84) (<= ~mode3 ~mode2) .cse12 (<= ~r1 .cse13) (<= 0 (+ ~send3 ~mode1 256)) (<= ~st1 ULTIMATE.start_main_~i2~84) .cse14 (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= ~st2 .cse15) (<= (+ ~alive3 ~p3_old) 254) (<= ~st3 .cse15) .cse16 (<= (+ ~alive1 ~p3_new) 510) (<= (+ ~r1 ~alive2 1) 0))) (let ((.cse17 (* 2 ULTIMATE.start_main_~c1~84)) (.cse19 (* 2 ULTIMATE.start_assert_~arg)) (.cse18 (* 2 ULTIMATE.start_check_~tmp~77)) (.cse20 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= .cse17 2) .cse0 (<= 2 .cse18) (<= 2 .cse17) (<= 1 ~mode2) (<= 2 .cse19) (<= .cse19 2) (<= .cse18 2) (<= (+ ~alive2 ~mode3 255) 0) .cse2 (<= ULTIMATE.start_main_~i2~84 (+ ~r1 1)) .cse3 (<= ULTIMATE.start_main_~i2~84 (+ ~p3_old 2)) .cse4 (<= .cse20 2) (<= 2 .cse20) (<= (+ ~p3_new ~mode1) 0) (<= (+ ~p2_new ~mode3) 0) (<= ~mode3 (+ ~alive3 1)) .cse8 .cse9 (<= ~st3 .cse13) (<= ~mode1 ULTIMATE.start_main_~i2~84) .cse10 (<= 0 (+ ~send3 ~alive2 256)) (<= 0 (+ ~alive2 ~p3_new 257)) (<= (+ ~mode1 ~id3) 128) .cse12 (<= (+ ~alive3 ~mode3) 1) .cse14 (<= (+ ~p1_new ~mode2) 0) .cse16))))) [2018-12-03 18:56:11,156 INFO L444 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (let ((.cse0 (+ ~id2 ~id3))) (and (<= 2 (+ ~mode1 ~mode3)) (<= ~mode1 (+ ~nomsg 2)) (<= 0 (+ ~st1 ~p3_old 1)) (<= (+ ~p3_old 1) ~st2) (<= 1 (+ ~st2 ULTIMATE.start_check_~tmp~77)) (<= ~id2 (+ ~r1 127)) (<= (+ ~alive3 ~mode3) 1) (<= ~mode2 (+ ~p3_new 2)) (<= (* 2 ~st3) 0) (<= 1 (+ ~st3 ULTIMATE.start_main_~c1~84)) (<= ~p2_new ~p1_new) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (<= ULTIMATE.start_check_~tmp~77 (+ ~p1_new 2)) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= .cse0 253) (<= ~send2 ~id2) (<= ~nomsg ~p2_new) (<= ~send3 ~id3) (<= (+ ~p1_new ~mode2) 0) (<= ~r1 (+ ~p2_new 1)) (<= 0 (+ ~alive2 ~nomsg 257)) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p3_new 1) ~alive3) (<= (+ ~alive2 256) ~r1) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= 1 .cse0) (<= ~st3 ~p1_old) (<= (+ ~st1 1) ~mode2) (<= (+ ULTIMATE.start_main_~c1~84 ~st2) 1) (<= (+ ~send3 ~p1_old) 253) (<= ~id2 ~send2) (<= ~p1_old (+ ~st1 127)) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 18:56:11,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-12-03 18:56:11,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-12-03 18:56:11,157 INFO L444 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse33 (+ ~p3_new 1)) (.cse34 (+ ~id2 ~id3))) (let ((.cse0 (<= ~send2 ~id2)) (.cse1 (<= (+ ~alive3 ~p1_old) 254)) (.cse2 (<= ~send3 ~id3)) (.cse3 (<= ~id3 ~send3)) (.cse4 (<= ~mode2 ULTIMATE.start_main_~i2~84)) (.cse5 (<= (+ ~p1_new ~id2) 253)) (.cse6 (<= (+ ~p1_new ~mode3) 0)) (.cse7 (<= (+ ~alive2 ~mode3 255) 0)) (.cse8 (<= 1 .cse34)) (.cse9 (<= 1 (+ ~r1 ~mode1))) (.cse10 (<= (+ ~p1_new ~send3) 253)) (.cse11 (<= (+ ~p1_new ~p1_old) 126)) (.cse17 (+ ~p2_new 1)) (.cse12 (<= 0 (+ ~st3 ~st2))) (.cse13 (<= ~id2 ~send2)) (.cse14 (<= 0 (+ (* 2 ~p3_new) 2))) (.cse15 (<= .cse33 ~st1)) (.cse16 (<= .cse34 253)) (.cse18 (<= 0 (+ ~alive2 ~p3_new 257))) (.cse19 (<= ~id2 (+ ~r1 127))) (.cse20 (<= (+ ~alive3 ~mode3) 1)) (.cse21 (<= (* 2 ~st3) 0)) (.cse22 (<= ~send3 (+ ~st2 127))) (.cse23 (<= ~nomsg ~p2_new)) (.cse24 (<= .cse33 ~alive3)) (.cse25 (<= ~st1 ~id3)) (.cse26 (<= .cse33 ~send2)) (.cse27 (<= ~st2 (+ ~nomsg 1))) (.cse28 (<= (+ ~r1 ~alive2 1) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p3_new ~p1_old) .cse12 .cse13 (<= ~mode1 (+ ~nomsg 2)) .cse14 (<= ~st1 ~mode2) .cse15 .cse16 (<= .cse17 ULTIMATE.start_main_~i2~84) .cse18 .cse19 .cse20 .cse21 (<= ULTIMATE.start_main_~i2~84 ~r1) .cse22 .cse23 (<= (* 2 ~r1) 0) (<= 0 (+ ~p1_new ~p3_new 1)) .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse29 (* 2 ULTIMATE.start_main_~c1~84)) (.cse31 (* 2 ULTIMATE.start_assert_~arg)) (.cse30 (* 2 ULTIMATE.start_check_~tmp~77)) (.cse32 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= .cse29 2) .cse0 (<= 2 .cse30) (<= 2 .cse29) .cse1 .cse2 .cse3 .cse4 (<= 2 .cse31) (<= .cse31 2) (<= .cse30 2) (<= (+ ~p1_old ~id3) 253) .cse5 .cse6 (<= ~mode2 (+ ~p1_old 1)) .cse7 .cse8 .cse9 (<= .cse32 2) (<= 2 .cse32) .cse10 .cse11 (<= (+ ULTIMATE.start_main_~i2~84 ~mode1) 1) (<= .cse17 ~st2) (<= ~r1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~mode2) .cse12 .cse13 .cse14 .cse15 (<= ~st1 ~mode1) .cse16 (<= 0 (+ ~p1_new ~r1)) .cse18 (<= (* 2 ~st2) 0) .cse19 .cse20 .cse21 (<= ~st1 ULTIMATE.start_main_~i2~84) .cse22 (<= (+ ~r1 ~send2) 128) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28))))) [2018-12-03 18:56:11,157 INFO L444 ceAbstractionStarter]: At program point L315(lines 193 315) the Hoare annotation is: (let ((.cse6 (+ ~p3_new 1)) (.cse21 (+ ~id2 ~id3)) (.cse7 (+ ~nomsg 1)) (.cse11 (+ ~p2_new 1))) (let ((.cse0 (<= ~send2 ~id2)) (.cse2 (let ((.cse22 (<= ~send3 ~id3)) (.cse23 (<= ~id3 ~send3)) (.cse24 (<= ~r1 .cse11)) (.cse25 (<= ~st2 .cse7))) (or (and .cse22 .cse23 (<= (+ ~mode1 255) ~p3_new) (<= ULTIMATE.start_main_~i2~84 ~st2) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ~p3_new ~mode3 258) 0) (<= 0 (+ ~p1_old ~p3_old 2)) .cse24 .cse25 (<= (+ ~p1_old ~mode2 1) 0)) (and .cse22 .cse23 (<= (+ ~p1_old ~id3) 253) (<= 1 (+ ~st2 ~mode1)) (<= (+ ~nomsg 2) ~mode3) (<= (+ ULTIMATE.start_main_~i2~84 ~p1_old) 128) (<= 0 (+ ~p1_new ~st3 1)) (<= 0 (+ ~p1_old ~p3_new 1)) .cse24 .cse25)))) (.cse3 (<= 1 .cse21)) (.cse4 (<= (+ ~mode2 ~p3_old) 0)) (.cse8 (<= ~id2 ~send2)) (.cse9 (<= .cse21 253)) (.cse13 (+ ~alive2 256)) (.cse10 (<= (+ ~st1 ~mode3) 1)) (.cse12 (<= ~id2 (+ ~r1 127))) (.cse14 (<= ~mode2 (+ ~st1 1))) (.cse16 (<= .cse6 ~send2))) (or (let ((.cse1 (+ ~send1 ~send2)) (.cse5 (+ ~send1 ~st1)) (.cse15 (+ ~mode1 256))) (and .cse0 (and (<= (+ ~send1 ~send3) 253) (<= 1 .cse1)) (<= .cse1 253) (<= ~mode1 0) (<= 1 (+ ~send1 ~id3)) .cse2 .cse3 (<= 0 (+ ~alive3 ULTIMATE.start_main_~i2~84)) .cse4 (<= (+ ~p3_old 1) ~mode2) (<= 0 .cse5) (<= .cse6 ~mode2) (<= 0 (+ ~st3 ULTIMATE.start_main_~i2~84)) (<= (+ ~p1_new 1) ULTIMATE.start_main_~i2~84) (<= .cse7 ULTIMATE.start_main_~i2~84) .cse8 (<= ~id3 (+ ~mode2 127)) (<= (+ ULTIMATE.start_main_~i2~84 256) ~alive1) (<= 0 (+ ~p1_new ~mode2 1)) .cse9 (<= .cse5 127) .cse10 (<= .cse11 ULTIMATE.start_main_~i2~84) (<= ~mode3 ~mode2) .cse12 (<= ~r1 .cse13) (<= 0 (+ ~send3 ~mode1 256)) (<= ~st1 ULTIMATE.start_main_~i2~84) .cse14 (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= ~st2 .cse15) (<= (+ ~alive3 ~p3_old) 254) (<= ~st3 .cse15) .cse16 (<= (+ ~alive1 ~p3_new) 510) (<= (+ ~r1 ~alive2 1) 0))) (let ((.cse17 (* 2 ULTIMATE.start_main_~c1~84)) (.cse19 (* 2 ULTIMATE.start_assert_~arg)) (.cse18 (* 2 ULTIMATE.start_check_~tmp~77)) (.cse20 (* 2 |ULTIMATE.start_assert_#in~arg|))) (and (<= .cse17 2) .cse0 (<= 2 .cse18) (<= 2 .cse17) (<= 1 ~mode2) (<= 2 .cse19) (<= .cse19 2) (<= .cse18 2) (<= (+ ~alive2 ~mode3 255) 0) .cse2 (<= ULTIMATE.start_main_~i2~84 (+ ~r1 1)) .cse3 (<= ULTIMATE.start_main_~i2~84 (+ ~p3_old 2)) .cse4 (<= .cse20 2) (<= 2 .cse20) (<= (+ ~p3_new ~mode1) 0) (<= (+ ~p2_new ~mode3) 0) (<= ~mode3 (+ ~alive3 1)) .cse8 .cse9 (<= ~st3 .cse13) (<= ~mode1 ULTIMATE.start_main_~i2~84) .cse10 (<= 0 (+ ~send3 ~alive2 256)) (<= 0 (+ ~alive2 ~p3_new 257)) (<= (+ ~mode1 ~id3) 128) .cse12 (<= (+ ~alive3 ~mode3) 1) .cse14 (<= (+ ~p1_new ~mode2) 0) .cse16))))) [2018-12-03 18:56:11,157 INFO L444 ceAbstractionStarter]: At program point L245(lines 245 254) the Hoare annotation is: (let ((.cse0 (+ ~p2_new 1)) (.cse1 (+ ~p3_new 1))) (and (<= .cse0 ULTIMATE.start_main_~i2~84) (<= (+ ~alive3 ~mode3) 1) (<= 1 (+ ~send2 ~id3)) (<= (* 2 ~st3) 0) (<= ~r1 (+ ~alive2 256)) (<= ~alive3 (+ ~st1 255)) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ULTIMATE.start_main_~i2~84 ~st2) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ~mode1 ~nomsg) 0) (<= (+ ~p1_new ~send3) 253) (<= (+ ~p1_new ~id2) 253) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (* 2 ~p1_new) 254) (<= (+ ~id2 ~id3) 253) (<= 2 (+ ~mode1 ~mode2)) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (+ ~nomsg ~mode2) 0) (<= (+ ~p1_new ~mode3) 0) (<= ~r1 .cse0) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ (* 2 ~p3_new) 2) 0) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new ~send2) 126) (<= ~st2 ~st3) (<= 0 (+ ~p1_new ~p3_new 1)) (<= .cse1 ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= ULTIMATE.start_main_~i2~84 .cse1) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 18:56:11,157 INFO L444 ceAbstractionStarter]: At program point L309(lines 309 316) the Hoare annotation is: false [2018-12-03 18:56:11,158 INFO L444 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (let ((.cse1 (+ ~p3_old 1)) (.cse0 (+ ~nomsg 2))) (and (<= ~mode1 .cse0) (<= 0 (+ ~p1_new ~st3 1)) (<= .cse1 ~st2) (<= ~alive3 .cse1) (<= 0 (+ ~p1_old ~p3_new 1)) (<= 1 (+ ~send2 ~id3)) (<= ~mode2 (+ ~p3_new 2)) (<= (* 2 ~st3) 0) (<= ~p2_new ~p1_new) (<= (+ ~p1_old ~id3) 253) (<= 1 (+ ~st2 ~mode1)) (<= ULTIMATE.start_main_~i2~84 ~r1) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (<= (* 2 ~p1_old) 254) (<= 0 (+ ULTIMATE.start_main_~i2~84 ~st1)) (<= (+ ~id2 ~id3) 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= (+ ~p1_new 1) ~st1) (<= ~r1 (+ ~p2_new 1)) (<= ~alive3 (+ ~alive2 256)) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= (+ ~p2_new ~send2) 126) (<= (+ ~p3_new 1) ~alive3) (<= ~st1 ~id3) (<= ~id3 ~send3) (<= (+ ~alive3 ~alive2 256) 0) (<= (+ ~st1 1) ~mode2) (<= .cse0 ~mode3) (<= ~st2 (+ ~nomsg 1)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)))) [2018-12-03 18:56:11,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-12-03 18:56:11,158 INFO L444 ceAbstractionStarter]: At program point L260(lines 253 261) the Hoare annotation is: (let ((.cse0 (+ ~p2_new 1)) (.cse2 (+ ~id2 ~id3)) (.cse1 (+ ~st1 1)) (.cse3 (+ ~p3_new 1))) (and (<= 2 (+ ~mode1 ~mode3)) (<= .cse0 ULTIMATE.start_main_~i2~84) (<= ~id2 (+ ~r1 127)) (<= ~r1 (+ ~alive2 256)) (<= ~st1 ULTIMATE.start_main_~i2~84) (<= ~mode2 .cse1) (<= ~alive3 .cse0) (<= (+ ULTIMATE.start_main_~i2~84 ~mode3) 1) (<= (+ ~p1_new ~send3) 253) (<= (+ ~p1_new ~id2) 253) (<= .cse2 253) (<= ~send2 ~id2) (<= ~send3 ~id3) (<= 0 (+ ~st3 ~st2)) (<= (+ ~alive2 ~nomsg 257) 0) (<= (+ ~send3 ULTIMATE.start_main_~i2~84) 127) (<= 0 (+ ~p1_new ~p3_new 1)) (<= .cse3 ~alive3) (<= 1 (+ ~st1 ~mode1)) (<= ~id3 ~send3) (<= 1 .cse2) (<= 0 (+ ~send3 ~st1)) (<= .cse1 ~mode2) (<= (+ ULTIMATE.start_main_~i2~84 ~mode1) 1) (<= 0 (+ ~p2_new ~r1 1)) (<= ~p1_new (+ ~mode3 126)) (<= ~id2 ~send2) (<= 1 (+ ~send2 ~mode1)) (<= ~st3 (+ ~nomsg 1)) (<= ~st2 .cse3))) [2018-12-03 18:56:11,223 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:56:11 BoogieIcfgContainer [2018-12-03 18:56:11,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:56:11,224 INFO L168 Benchmark]: Toolchain (without parser) took 475862.45 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -162.5 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 258.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 18:56:11,225 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:56:11,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.60 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:56:11,228 INFO L168 Benchmark]: Boogie Preprocessor took 54.62 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:56:11,231 INFO L168 Benchmark]: RCFGBuilder took 624.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 18:56:11,232 INFO L168 Benchmark]: TraceAbstraction took 475138.84 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -162.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 226.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 18:56:11,241 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.60 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 54.62 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 624.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 475138.84 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -162.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 226.4 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: 317]: 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: 234]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~p2_new + 1 <= main_~i2~84 && ~alive3 + ~mode3 <= 1) && 1 <= ~send2 + ~id3) && 2 * ~st3 <= 0) && ~r1 <= ~alive2 + 256) && ~alive3 <= ~st1 + 255) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~st2) && main_~i2~84 <= ~r1) && ~mode1 + ~nomsg <= 0) && ~p1_new + ~send3 <= 253) && ~p1_new + ~id2 <= 253) && 0 <= main_~i2~84 + ~st1) && 2 * ~p1_new <= 254) && ~id2 + ~id3 <= 253) && 2 <= ~mode1 + ~mode2) && ~send2 <= ~id2) && ~send3 <= ~id3) && ~nomsg + ~mode2 <= 0) && ~p1_new + ~mode3 <= 0) && ~r1 <= ~p2_new + 1) && ~alive2 + ~nomsg + 257 <= 0) && 2 * ~p3_new + 2 <= 0) && ~send3 + main_~i2~84 <= 127) && ~p2_new + ~send2 <= 126) && ~st2 <= ~st3) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && main_~i2~84 <= ~p3_new + 1) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((~mode1 <= ~nomsg + 2 && 0 <= ~p1_new + ~st3 + 1) && ~p3_old + 1 <= ~st2) && ~alive3 <= ~p3_old + 1) && 0 <= ~p1_old + ~p3_new + 1) && 1 <= ~send2 + ~id3) && ~mode2 <= ~p3_new + 2) && 2 * ~st3 <= 0) && ~p2_new <= ~p1_new) && ~p1_old + ~id3 <= 253) && 1 <= ~st2 + ~mode1) && main_~i2~84 <= ~r1) && main_~i2~84 + ~mode3 <= 1) && 2 * ~p1_old <= 254) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && ~p1_new + 1 <= ~st1) && ~r1 <= ~p2_new + 1) && ~alive3 <= ~alive2 + 256) && ~send3 + main_~i2~84 <= 127) && ~p2_new + ~send2 <= 126) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && ~alive3 + ~alive2 + 256 <= 0) && ~st1 + 1 <= ~mode2) && ~nomsg + 2 <= ~mode3) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((~p1_new + ~alive2 + 257 <= 0 && main_~i2~84 + ~alive2 + 256 <= 0) && ~alive2 + check_~tmp~77 + 255 <= 0) && 0 <= ~alive3 + ~alive2 + 256) && ~p2_new + ~alive2 + 257 <= 0) && 0 <= ~p1_old + ~p3_new + 1) && ~st1 <= ~alive2 + 256) && 1 <= ~send2 + ~id3) && 0 <= ~p3_new + ~st1 + 1) && 0 <= ~alive2 + ~p3_old + 257) && ~p1_old + ~id3 <= 253) && ~r1 <= ~alive2 + 256) && ~st3 + ~p3_new + 1 <= 0) && ~alive2 + 256 <= ~st2) && ~mode1 <= ~p2_new + 2) && ~p1_old + check_~tmp~77 <= 128) && ~alive2 + 256 <= ~send3) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~st2 <= ~alive2 + 256) && ~send3 <= ~id3) && ~send3 + ~alive2 + 129 <= 0) && ~alive2 + 256 <= main_~i2~84) && ~mode2 <= ~p1_new + 2) && 0 <= ~alive2 + ~nomsg + 257) && ~alive2 + ~nomsg + 257 <= 0) && ~p2_new + ~send2 <= 126) && ~alive2 + 257 <= ~mode1) && ~alive2 + 256 <= ~st3) && ~id3 <= ~send3) && 1 <= check_~tmp~77) && ~alive3 + ~alive2 + 256 <= 0) && ~p3_old + 2 <= ~mode3) && 0 <= ~r1 + ~alive2 + 256) && ~alive2 + 257 <= ~mode2) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1) && ~mode3 <= ~alive2 + 257 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((~send2 <= ~id2 && ~alive3 + ~p1_old <= 254) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~mode2 <= main_~i2~84) && ~p1_new + ~id2 <= 253) && ~p1_new + ~mode3 <= 0) && ~alive2 + ~mode3 + 255 <= 0) && 1 <= ~id2 + ~id3) && 1 <= ~r1 + ~mode1) && ~p1_new + ~send3 <= 253) && ~p1_new + ~p1_old <= 126) && ~p3_new <= ~p1_old) && 0 <= ~st3 + ~st2) && ~id2 <= ~send2) && ~mode1 <= ~nomsg + 2) && 0 <= 2 * ~p3_new + 2) && ~st1 <= ~mode2) && ~p3_new + 1 <= ~st1) && ~id2 + ~id3 <= 253) && ~p2_new + 1 <= main_~i2~84) && 0 <= ~alive2 + ~p3_new + 257) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && main_~i2~84 <= ~r1) && ~send3 <= ~st2 + 127) && ~nomsg <= ~p2_new) && 2 * ~r1 <= 0) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~p3_new + 1 <= ~send2) && ~st2 <= ~nomsg + 1) && ~r1 + ~alive2 + 1 <= 0) || ((((((((((((((((((((((((((((((((((((((((((((((2 * main_~c1~84 <= 2 && ~send2 <= ~id2) && 2 <= 2 * check_~tmp~77) && 2 <= 2 * main_~c1~84) && ~alive3 + ~p1_old <= 254) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~mode2 <= main_~i2~84) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && 2 * check_~tmp~77 <= 2) && ~p1_old + ~id3 <= 253) && ~p1_new + ~id2 <= 253) && ~p1_new + ~mode3 <= 0) && ~mode2 <= ~p1_old + 1) && ~alive2 + ~mode3 + 255 <= 0) && 1 <= ~id2 + ~id3) && 1 <= ~r1 + ~mode1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~p1_new + ~send3 <= 253) && ~p1_new + ~p1_old <= 126) && main_~i2~84 + ~mode1 <= 1) && ~p2_new + 1 <= ~st2) && ~r1 <= main_~i2~84) && main_~i2~84 <= ~mode2) && 0 <= ~st3 + ~st2) && ~id2 <= ~send2) && 0 <= 2 * ~p3_new + 2) && ~p3_new + 1 <= ~st1) && ~st1 <= ~mode1) && ~id2 + ~id3 <= 253) && 0 <= ~p1_new + ~r1) && 0 <= ~alive2 + ~p3_new + 257) && 2 * ~st2 <= 0) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && ~st1 <= main_~i2~84) && ~send3 <= ~st2 + 127) && ~r1 + ~send2 <= 128) && ~nomsg <= ~p2_new) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~p3_new + 1 <= ~send2) && ~st2 <= ~nomsg + 1) && ~r1 + ~alive2 + 1 <= 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((~send2 <= ~id2 && ~send1 + ~send3 <= 253 && 1 <= ~send1 + ~send2) && ~send1 + ~send2 <= 253) && ~mode1 <= 0) && 1 <= ~send1 + ~id3) && ((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~mode1 + 255 <= ~p3_new) && main_~i2~84 <= ~st2) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0) || (((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~p1_old + ~id3 <= 253) && 1 <= ~st2 + ~mode1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~p1_old + ~p3_new + 1) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1))) && 1 <= ~id2 + ~id3) && 0 <= ~alive3 + main_~i2~84) && ~mode2 + ~p3_old <= 0) && ~p3_old + 1 <= ~mode2) && 0 <= ~send1 + ~st1) && ~p3_new + 1 <= ~mode2) && 0 <= ~st3 + main_~i2~84) && ~p1_new + 1 <= main_~i2~84) && ~nomsg + 1 <= main_~i2~84) && ~id2 <= ~send2) && ~id3 <= ~mode2 + 127) && main_~i2~84 + 256 <= ~alive1) && 0 <= ~p1_new + ~mode2 + 1) && ~id2 + ~id3 <= 253) && ~send1 + ~st1 <= 127) && ~st1 + ~mode3 <= 1) && ~p2_new + 1 <= main_~i2~84) && ~mode3 <= ~mode2) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && 0 <= ~send3 + ~mode1 + 256) && ~st1 <= main_~i2~84) && ~mode2 <= ~st1 + 1) && 0 <= main_~i2~84 + ~st1) && ~st2 <= ~mode1 + 256) && ~alive3 + ~p3_old <= 254) && ~st3 <= ~mode1 + 256) && ~p3_new + 1 <= ~send2) && ~alive1 + ~p3_new <= 510) && ~r1 + ~alive2 + 1 <= 0) || (((((((((((((((((((((((((((((((2 * main_~c1~84 <= 2 && ~send2 <= ~id2) && 2 <= 2 * check_~tmp~77) && 2 <= 2 * main_~c1~84) && 1 <= ~mode2) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && 2 * check_~tmp~77 <= 2) && ~alive2 + ~mode3 + 255 <= 0) && ((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~mode1 + 255 <= ~p3_new) && main_~i2~84 <= ~st2) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0) || (((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~p1_old + ~id3 <= 253) && 1 <= ~st2 + ~mode1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~p1_old + ~p3_new + 1) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1))) && main_~i2~84 <= ~r1 + 1) && 1 <= ~id2 + ~id3) && main_~i2~84 <= ~p3_old + 2) && ~mode2 + ~p3_old <= 0) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~p3_new + ~mode1 <= 0) && ~p2_new + ~mode3 <= 0) && ~mode3 <= ~alive3 + 1) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~st3 <= ~alive2 + 256) && ~mode1 <= main_~i2~84) && ~st1 + ~mode3 <= 1) && 0 <= ~send3 + ~alive2 + 256) && 0 <= ~alive2 + ~p3_new + 257) && ~mode1 + ~id3 <= 128) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~st1 + 1) && ~p1_new + ~mode2 <= 0) && ~p3_new + 1 <= ~send2) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~p2_new + 1 <= main_~i2~84 && ~alive3 + ~mode3 <= 1) && 1 <= ~send2 + ~id3) && 2 * ~st3 <= 0) && ~r1 <= ~alive2 + 256) && ~alive3 <= ~st1 + 255) && ~st1 <= main_~i2~84) && main_~i2~84 <= ~st2) && main_~i2~84 <= ~r1) && ~mode1 + ~nomsg <= 0) && ~p1_new + ~send3 <= 253) && ~p1_new + ~id2 <= 253) && 0 <= main_~i2~84 + ~st1) && 2 * ~p1_new <= 254) && ~id2 + ~id3 <= 253) && 2 <= ~mode1 + ~mode2) && ~send2 <= ~id2) && ~send3 <= ~id3) && ~nomsg + ~mode2 <= 0) && ~p1_new + ~mode3 <= 0) && ~r1 <= ~p2_new + 1) && ~alive2 + ~nomsg + 257 <= 0) && 2 * ~p3_new + 2 <= 0) && ~send3 + main_~i2~84 <= 127) && ~p2_new + ~send2 <= 126) && ~st2 <= ~st3) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && main_~i2~84 <= ~p3_new + 1) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((~send2 <= ~id2 && ~alive3 + ~p1_old <= 254) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~mode2 <= main_~i2~84) && ~p1_new + ~id2 <= 253) && ~p1_new + ~mode3 <= 0) && ~alive2 + ~mode3 + 255 <= 0) && 1 <= ~id2 + ~id3) && 1 <= ~r1 + ~mode1) && ~p1_new + ~send3 <= 253) && ~p1_new + ~p1_old <= 126) && ~p3_new <= ~p1_old) && 0 <= ~st3 + ~st2) && ~id2 <= ~send2) && ~mode1 <= ~nomsg + 2) && 0 <= 2 * ~p3_new + 2) && ~st1 <= ~mode2) && ~p3_new + 1 <= ~st1) && ~id2 + ~id3 <= 253) && ~p2_new + 1 <= main_~i2~84) && 0 <= ~alive2 + ~p3_new + 257) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && main_~i2~84 <= ~r1) && ~send3 <= ~st2 + 127) && ~nomsg <= ~p2_new) && 2 * ~r1 <= 0) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~p3_new + 1 <= ~send2) && ~st2 <= ~nomsg + 1) && ~r1 + ~alive2 + 1 <= 0) || ((((((((((((((((((((((((((((((((((((((((((((((2 * main_~c1~84 <= 2 && ~send2 <= ~id2) && 2 <= 2 * check_~tmp~77) && 2 <= 2 * main_~c1~84) && ~alive3 + ~p1_old <= 254) && ~send3 <= ~id3) && ~id3 <= ~send3) && ~mode2 <= main_~i2~84) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && 2 * check_~tmp~77 <= 2) && ~p1_old + ~id3 <= 253) && ~p1_new + ~id2 <= 253) && ~p1_new + ~mode3 <= 0) && ~mode2 <= ~p1_old + 1) && ~alive2 + ~mode3 + 255 <= 0) && 1 <= ~id2 + ~id3) && 1 <= ~r1 + ~mode1) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~p1_new + ~send3 <= 253) && ~p1_new + ~p1_old <= 126) && main_~i2~84 + ~mode1 <= 1) && ~p2_new + 1 <= ~st2) && ~r1 <= main_~i2~84) && main_~i2~84 <= ~mode2) && 0 <= ~st3 + ~st2) && ~id2 <= ~send2) && 0 <= 2 * ~p3_new + 2) && ~p3_new + 1 <= ~st1) && ~st1 <= ~mode1) && ~id2 + ~id3 <= 253) && 0 <= ~p1_new + ~r1) && 0 <= ~alive2 + ~p3_new + 257) && 2 * ~st2 <= 0) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && 2 * ~st3 <= 0) && ~st1 <= main_~i2~84) && ~send3 <= ~st2 + 127) && ~r1 + ~send2 <= 128) && ~nomsg <= ~p2_new) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~p3_new + 1 <= ~send2) && ~st2 <= ~nomsg + 1) && ~r1 + ~alive2 + 1 <= 0) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((~mode1 <= ~nomsg + 2 && assert_#in~arg <= ~p3_old + 2) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~p3_new + 2) && 2 * ~st3 <= 0) && 1 <= ~st3 + main_~c1~84) && ~r1 <= ~alive2 + 256) && ~p1_old + ~id3 <= 253) && main_~c1~84 <= ~mode1) && main_~i2~84 + ~mode3 <= 1) && check_~tmp~77 <= ~p1_new + 2) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && assert_#in~arg <= ~r1 + 1) && ~p1_new + 1 <= ~st1) && ~alive2 + ~nomsg + 257 <= 0) && ~send2 + check_~tmp~77 <= 128) && ~send3 + main_~i2~84 <= 127) && ~p2_new + 2 <= assert_#in~arg) && ~p3_new + 1 <= ~alive3) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st1 + 1 <= ~mode2) && ~nomsg + 2 <= ~mode3) && main_~c1~84 + ~p1_old <= 128) && ~st2 <= ~nomsg + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((2 <= ~mode1 + ~mode3 && ~mode1 <= ~nomsg + 2) && 0 <= ~st1 + ~p3_old + 1) && ~p3_old + 1 <= ~st2) && 1 <= ~st2 + check_~tmp~77) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~p3_new + 2) && 2 * ~st3 <= 0) && 1 <= ~st3 + main_~c1~84) && ~p2_new <= ~p1_new) && main_~i2~84 + ~mode3 <= 1) && check_~tmp~77 <= ~p1_new + 2) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~nomsg <= ~p2_new) && ~send3 <= ~id3) && ~p1_new + ~mode2 <= 0) && ~r1 <= ~p2_new + 1) && 0 <= ~alive2 + ~nomsg + 257) && ~send3 + main_~i2~84 <= 127) && ~p3_new + 1 <= ~alive3) && ~alive2 + 256 <= ~r1) && ~st1 <= ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && ~st3 <= ~p1_old) && ~st1 + 1 <= ~mode2) && main_~c1~84 + ~st2 <= 1) && ~send3 + ~p1_old <= 253) && ~id2 <= ~send2) && ~p1_old <= ~st1 + 127) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((~send2 <= ~id2 && ~send1 + ~send3 <= 253 && 1 <= ~send1 + ~send2) && ~send1 + ~send2 <= 253) && ~mode1 <= 0) && 1 <= ~send1 + ~id3) && ((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~mode1 + 255 <= ~p3_new) && main_~i2~84 <= ~st2) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0) || (((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~p1_old + ~id3 <= 253) && 1 <= ~st2 + ~mode1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~p1_old + ~p3_new + 1) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1))) && 1 <= ~id2 + ~id3) && 0 <= ~alive3 + main_~i2~84) && ~mode2 + ~p3_old <= 0) && ~p3_old + 1 <= ~mode2) && 0 <= ~send1 + ~st1) && ~p3_new + 1 <= ~mode2) && 0 <= ~st3 + main_~i2~84) && ~p1_new + 1 <= main_~i2~84) && ~nomsg + 1 <= main_~i2~84) && ~id2 <= ~send2) && ~id3 <= ~mode2 + 127) && main_~i2~84 + 256 <= ~alive1) && 0 <= ~p1_new + ~mode2 + 1) && ~id2 + ~id3 <= 253) && ~send1 + ~st1 <= 127) && ~st1 + ~mode3 <= 1) && ~p2_new + 1 <= main_~i2~84) && ~mode3 <= ~mode2) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && 0 <= ~send3 + ~mode1 + 256) && ~st1 <= main_~i2~84) && ~mode2 <= ~st1 + 1) && 0 <= main_~i2~84 + ~st1) && ~st2 <= ~mode1 + 256) && ~alive3 + ~p3_old <= 254) && ~st3 <= ~mode1 + 256) && ~p3_new + 1 <= ~send2) && ~alive1 + ~p3_new <= 510) && ~r1 + ~alive2 + 1 <= 0) || (((((((((((((((((((((((((((((((2 * main_~c1~84 <= 2 && ~send2 <= ~id2) && 2 <= 2 * check_~tmp~77) && 2 <= 2 * main_~c1~84) && 1 <= ~mode2) && 2 <= 2 * assert_~arg) && 2 * assert_~arg <= 2) && 2 * check_~tmp~77 <= 2) && ~alive2 + ~mode3 + 255 <= 0) && ((((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~mode1 + 255 <= ~p3_new) && main_~i2~84 <= ~st2) && main_~i2~84 <= ~r1) && ~p3_new + ~mode3 + 258 <= 0) && 0 <= ~p1_old + ~p3_old + 2) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1) && ~p1_old + ~mode2 + 1 <= 0) || (((((((((~send3 <= ~id3 && ~id3 <= ~send3) && ~p1_old + ~id3 <= 253) && 1 <= ~st2 + ~mode1) && ~nomsg + 2 <= ~mode3) && main_~i2~84 + ~p1_old <= 128) && 0 <= ~p1_new + ~st3 + 1) && 0 <= ~p1_old + ~p3_new + 1) && ~r1 <= ~p2_new + 1) && ~st2 <= ~nomsg + 1))) && main_~i2~84 <= ~r1 + 1) && 1 <= ~id2 + ~id3) && main_~i2~84 <= ~p3_old + 2) && ~mode2 + ~p3_old <= 0) && 2 * assert_#in~arg <= 2) && 2 <= 2 * assert_#in~arg) && ~p3_new + ~mode1 <= 0) && ~p2_new + ~mode3 <= 0) && ~mode3 <= ~alive3 + 1) && ~id2 <= ~send2) && ~id2 + ~id3 <= 253) && ~st3 <= ~alive2 + 256) && ~mode1 <= main_~i2~84) && ~st1 + ~mode3 <= 1) && 0 <= ~send3 + ~alive2 + 256) && 0 <= ~alive2 + ~p3_new + 257) && ~mode1 + ~id3 <= 128) && ~id2 <= ~r1 + 127) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~st1 + 1) && ~p1_new + ~mode2 <= 0) && ~p3_new + 1 <= ~send2) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((2 <= ~mode1 + ~mode3 && ~mode1 <= ~nomsg + 2) && assert_#in~arg <= ~p3_old + 2) && 0 <= ~p1_new + ~st3 + 1) && ~p1_new + assert_~arg <= 0) && 1 <= ~st2 + check_~tmp~77) && ~id2 <= ~r1 + 127) && 0 <= ~p1_old + ~p3_new + 1) && ~alive3 + ~mode3 <= 1) && ~mode2 <= ~p3_new + 2) && ~p3_new + 1 <= ~st1) && ~p1_old + ~id3 <= 253) && ~p3_old + 2 <= assert_~arg) && main_~c1~84 <= ~mode1) && main_~i2~84 + ~mode3 <= 1) && 2 * ~p1_old <= 254) && ~nomsg + ~p3_old + 2 <= 0) && check_~tmp~77 <= ~p1_new + 2) && ~mode2 <= main_~c1~84) && 0 <= main_~i2~84 + ~st1) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && 2 * ~r1 <= 0) && 0 <= ~alive2 + ~nomsg + 257) && ~send3 + main_~i2~84 <= 127) && ~p2_new + 2 <= assert_#in~arg) && 1 <= assert_~arg + ~id3) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && 0 <= ~p2_new + ~st2 + 1) && ~st1 + 1 <= ~mode2) && ~p1_new + 1 <= ~r1) && assert_#in~arg + ~alive2 + 255 <= 0) && ~st3 + ~st2 <= 0) && assert_#in~arg <= ~alive3 + 1) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= ~mode1 + ~mode3 && ~p2_new + 1 <= main_~i2~84) && ~id2 <= ~r1 + 127) && ~r1 <= ~alive2 + 256) && ~st1 <= main_~i2~84) && ~mode2 <= ~st1 + 1) && ~alive3 <= ~p2_new + 1) && main_~i2~84 + ~mode3 <= 1) && ~p1_new + ~send3 <= 253) && ~p1_new + ~id2 <= 253) && ~id2 + ~id3 <= 253) && ~send2 <= ~id2) && ~send3 <= ~id3) && 0 <= ~st3 + ~st2) && ~alive2 + ~nomsg + 257 <= 0) && ~send3 + main_~i2~84 <= 127) && 0 <= ~p1_new + ~p3_new + 1) && ~p3_new + 1 <= ~alive3) && 1 <= ~st1 + ~mode1) && ~id3 <= ~send3) && 1 <= ~id2 + ~id3) && 0 <= ~send3 + ~st1) && ~st1 + 1 <= ~mode2) && main_~i2~84 + ~mode1 <= 1) && 0 <= ~p2_new + ~r1 + 1) && ~p1_new <= ~mode3 + 126) && ~id2 <= ~send2) && 1 <= ~send2 + ~mode1) && ~st3 <= ~nomsg + 1) && ~st2 <= ~p3_new + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 475.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 35.2s AutomataDifference, 0.0s DeadEndRemovalTime, 419.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 185 SDtfs, 499 SDslu, 290 SDs, 0 SdLazy, 447 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 287 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9790126359094917 AbsIntWeakeningRatio, 1.74 AbsIntAvgWeakeningVarsNumRemoved, 1265.16 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 29 NumberOfFragments, 3119 HoareAnnotationTreeSize, 13 FomulaSimplifications, 61617 FormulaSimplificationTreeSizeReduction, 48.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 99529 FormulaSimplificationTreeSizeReductionInter, 371.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 322 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 27068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 376/384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...