java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-1cc990c
[2018-10-01 00:54:38,277 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-10-01 00:54:38,279 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-01 00:54:38,293 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-01 00:54:38,293 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-01 00:54:38,294 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-01 00:54:38,295 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-01 00:54:38,297 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-01 00:54:38,301 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-01 00:54:38,302 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-01 00:54:38,303 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-01 00:54:38,303 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-01 00:54:38,304 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-01 00:54:38,305 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-01 00:54:38,306 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-01 00:54:38,307 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-01 00:54:38,307 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-01 00:54:38,309 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-01 00:54:38,311 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-01 00:54:38,313 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-01 00:54:38,314 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-01 00:54:38,315 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-01 00:54:38,318 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-01 00:54:38,318 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-01 00:54:38,318 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-01 00:54:38,319 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-01 00:54:38,320 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-01 00:54:38,321 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-01 00:54:38,322 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-01 00:54:38,323 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-01 00:54:38,323 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-01 00:54:38,328 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-01 00:54:38,328 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-01 00:54:38,328 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-01 00:54:38,330 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-01 00:54:38,331 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-10-01 00:54:38,333 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf
[2018-10-01 00:54:38,359 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-10-01 00:54:38,359 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-01 00:54:38,360 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-01 00:54:38,360 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-10-01 00:54:38,361 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-01 00:54:38,361 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-10-01 00:54:38,361 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-10-01 00:54:38,362 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-01 00:54:38,362 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-10-01 00:54:38,362 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-10-01 00:54:38,362 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-10-01 00:54:38,362 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-10-01 00:54:38,362 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-10-01 00:54:38,363 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-01 00:54:38,363 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-10-01 00:54:38,363 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-10-01 00:54:38,363 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-10-01 00:54:38,363 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-10-01 00:54:38,364 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-01 00:54:38,364 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-10-01 00:54:38,364 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-10-01 00:54:38,364 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-10-01 00:54:38,364 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-01 00:54:38,365 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-01 00:54:38,365 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-10-01 00:54:38,365 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-01 00:54:38,365 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-10-01 00:54:38,365 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-01 00:54:38,366 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-01 00:54:38,366 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-01 00:54:38,366 INFO  L133        SettingsManager]:  * Use predicate trie based predicate unification=true
[2018-10-01 00:54:38,430 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-01 00:54:38,446 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-01 00:54:38,451 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-01 00:54:38,453 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-10-01 00:54:38,454 INFO  L276        PluginConnector]: Boogie PL CUP Parser initialized
[2018-10-01 00:54:38,455 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl
[2018-10-01 00:54:38,455 INFO  L111           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl'
[2018-10-01 00:54:38,550 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-01 00:54:38,553 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-10-01 00:54:38,554 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-01 00:54:38,554 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-01 00:54:38,555 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-01 00:54:38,573 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,590 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,599 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-01 00:54:38,600 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-01 00:54:38,600 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-01 00:54:38,600 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-10-01 00:54:38,611 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,612 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,616 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,617 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,626 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,634 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,636 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/1) ...
[2018-10-01 00:54:38,647 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-01 00:54:38,647 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-01 00:54:38,647 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-10-01 00:54:38,648 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-10-01 00:54:38,652 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (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-10-01 00:54:38,733 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-10-01 00:54:38,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-10-01 00:54:39,371 INFO  L348             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-10-01 00:54:39,372 INFO  L202        PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:54:39 BoogieIcfgContainer
[2018-10-01 00:54:39,372 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-01 00:54:39,373 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-01 00:54:39,373 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-10-01 00:54:39,377 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-10-01 00:54:39,377 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:38" (1/2) ...
[2018-10-01 00:54:39,378 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73089b87 and model type pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:54:39, skipping insertion in model container
[2018-10-01 00:54:39,378 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:54:39" (2/2) ...
[2018-10-01 00:54:39,381 INFO  L112   eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl
[2018-10-01 00:54:39,392 INFO  L137   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-01 00:54:39,404 INFO  L149   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-10-01 00:54:39,455 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-10-01 00:54:39,455 INFO  L381      AbstractCegarLoop]: Interprodecural is true
[2018-10-01 00:54:39,456 INFO  L382      AbstractCegarLoop]: Hoare is true
[2018-10-01 00:54:39,456 INFO  L383      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-01 00:54:39,456 INFO  L384      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-01 00:54:39,456 INFO  L385      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-01 00:54:39,456 INFO  L386      AbstractCegarLoop]: Difference is false
[2018-10-01 00:54:39,457 INFO  L387      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-01 00:54:39,457 INFO  L392      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-01 00:54:39,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 19 states.
[2018-10-01 00:54:39,481 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-01 00:54:39,481 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:39,482 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:39,483 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:39,490 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:39,491 INFO  L82        PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times
[2018-10-01 00:54:39,493 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:39,494 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:39,563 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:39,563 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:39,563 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:39,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:39,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:39,790 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:39,790 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-01 00:54:39,794 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:39,806 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:39,806 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:39,808 INFO  L87              Difference]: Start difference. First operand 19 states. Second operand 3 states.
[2018-10-01 00:54:39,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:39,956 INFO  L93              Difference]: Finished difference Result 51 states and 71 transitions.
[2018-10-01 00:54:39,958 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:39,960 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-10-01 00:54:39,960 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:39,979 INFO  L225             Difference]: With dead ends: 51
[2018-10-01 00:54:39,982 INFO  L226             Difference]: Without dead ends: 33
[2018-10-01 00:54:39,987 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:40,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2018-10-01 00:54:40,036 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31.
[2018-10-01 00:54:40,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-10-01 00:54:40,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions.
[2018-10-01 00:54:40,040 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16
[2018-10-01 00:54:40,041 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:40,041 INFO  L480      AbstractCegarLoop]: Abstraction has 31 states and 43 transitions.
[2018-10-01 00:54:40,041 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:40,041 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions.
[2018-10-01 00:54:40,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-01 00:54:40,042 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:40,042 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:40,042 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:40,043 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:40,043 INFO  L82        PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times
[2018-10-01 00:54:40,043 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:40,043 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:40,046 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:40,046 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:40,046 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:40,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:40,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:40,184 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:40,185 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-01 00:54:40,186 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:40,187 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:40,187 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:40,187 INFO  L87              Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states.
[2018-10-01 00:54:40,243 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:40,243 INFO  L93              Difference]: Finished difference Result 91 states and 127 transitions.
[2018-10-01 00:54:40,244 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:40,244 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-10-01 00:54:40,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:40,246 INFO  L225             Difference]: With dead ends: 91
[2018-10-01 00:54:40,246 INFO  L226             Difference]: Without dead ends: 61
[2018-10-01 00:54:40,247 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:40,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2018-10-01 00:54:40,272 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59.
[2018-10-01 00:54:40,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-10-01 00:54:40,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions.
[2018-10-01 00:54:40,275 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16
[2018-10-01 00:54:40,275 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:40,275 INFO  L480      AbstractCegarLoop]: Abstraction has 59 states and 82 transitions.
[2018-10-01 00:54:40,276 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:40,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions.
[2018-10-01 00:54:40,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-01 00:54:40,277 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:40,277 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:40,278 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:40,278 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:40,279 INFO  L82        PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times
[2018-10-01 00:54:40,279 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:40,279 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:40,283 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:40,284 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:40,284 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:40,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:40,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:40,460 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:40,460 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-01 00:54:40,461 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:40,461 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:40,461 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:40,462 INFO  L87              Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states.
[2018-10-01 00:54:40,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:40,596 INFO  L93              Difference]: Finished difference Result 175 states and 244 transitions.
[2018-10-01 00:54:40,600 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:40,600 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-10-01 00:54:40,601 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:40,604 INFO  L225             Difference]: With dead ends: 175
[2018-10-01 00:54:40,605 INFO  L226             Difference]: Without dead ends: 117
[2018-10-01 00:54:40,608 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:40,608 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2018-10-01 00:54:40,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115.
[2018-10-01 00:54:40,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 115 states.
[2018-10-01 00:54:40,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions.
[2018-10-01 00:54:40,665 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16
[2018-10-01 00:54:40,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:40,668 INFO  L480      AbstractCegarLoop]: Abstraction has 115 states and 158 transitions.
[2018-10-01 00:54:40,669 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:40,669 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions.
[2018-10-01 00:54:40,669 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-01 00:54:40,669 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:40,670 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:40,670 INFO  L423      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:40,670 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:40,671 INFO  L82        PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times
[2018-10-01 00:54:40,671 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:40,671 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:40,674 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:40,675 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:40,675 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:40,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:40,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:40,930 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:40,930 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-01 00:54:40,931 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-01 00:54:40,931 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-01 00:54:40,931 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:40,932 INFO  L87              Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 4 states.
[2018-10-01 00:54:41,266 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:41,267 INFO  L93              Difference]: Finished difference Result 245 states and 331 transitions.
[2018-10-01 00:54:41,269 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-10-01 00:54:41,269 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-10-01 00:54:41,269 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:41,274 INFO  L225             Difference]: With dead ends: 245
[2018-10-01 00:54:41,275 INFO  L226             Difference]: Without dead ends: 243
[2018-10-01 00:54:41,275 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time
[2018-10-01 00:54:41,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 243 states.
[2018-10-01 00:54:41,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 131.
[2018-10-01 00:54:41,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2018-10-01 00:54:41,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions.
[2018-10-01 00:54:41,316 INFO  L78                 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 16
[2018-10-01 00:54:41,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:41,316 INFO  L480      AbstractCegarLoop]: Abstraction has 131 states and 174 transitions.
[2018-10-01 00:54:41,317 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-01 00:54:41,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions.
[2018-10-01 00:54:41,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-01 00:54:41,318 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:41,318 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:41,318 INFO  L423      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:41,318 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:41,318 INFO  L82        PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times
[2018-10-01 00:54:41,319 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:41,319 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:41,321 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:41,321 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:41,321 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:41,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:41,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:41,452 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:41,452 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-01 00:54:41,453 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:41,453 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:41,453 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:41,454 INFO  L87              Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 3 states.
[2018-10-01 00:54:41,653 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:41,654 INFO  L93              Difference]: Finished difference Result 319 states and 425 transitions.
[2018-10-01 00:54:41,655 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:41,655 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-10-01 00:54:41,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:41,658 INFO  L225             Difference]: With dead ends: 319
[2018-10-01 00:54:41,659 INFO  L226             Difference]: Without dead ends: 189
[2018-10-01 00:54:41,660 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:41,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2018-10-01 00:54:41,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189.
[2018-10-01 00:54:41,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 189 states.
[2018-10-01 00:54:41,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions.
[2018-10-01 00:54:41,724 INFO  L78                 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16
[2018-10-01 00:54:41,724 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:41,724 INFO  L480      AbstractCegarLoop]: Abstraction has 189 states and 248 transitions.
[2018-10-01 00:54:41,724 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:41,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions.
[2018-10-01 00:54:41,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-10-01 00:54:41,730 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:41,730 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:41,731 INFO  L423      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:41,731 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:41,731 INFO  L82        PathProgramCache]: Analyzing trace with hash -1265916431, now seen corresponding path program 1 times
[2018-10-01 00:54:41,731 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:41,731 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:41,733 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:41,734 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:41,734 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:41,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:41,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:41,861 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:41,862 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-01 00:54:41,862 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:41,862 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:41,862 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:41,862 INFO  L87              Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states.
[2018-10-01 00:54:42,176 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:42,176 INFO  L93              Difference]: Finished difference Result 561 states and 738 transitions.
[2018-10-01 00:54:42,177 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:42,177 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2018-10-01 00:54:42,177 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:42,180 INFO  L225             Difference]: With dead ends: 561
[2018-10-01 00:54:42,180 INFO  L226             Difference]: Without dead ends: 375
[2018-10-01 00:54:42,184 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:42,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 375 states.
[2018-10-01 00:54:42,247 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373.
[2018-10-01 00:54:42,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 373 states.
[2018-10-01 00:54:42,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions.
[2018-10-01 00:54:42,253 INFO  L78                 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30
[2018-10-01 00:54:42,253 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:42,253 INFO  L480      AbstractCegarLoop]: Abstraction has 373 states and 480 transitions.
[2018-10-01 00:54:42,255 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:42,255 INFO  L276                IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions.
[2018-10-01 00:54:42,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-10-01 00:54:42,257 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:42,258 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:42,258 INFO  L423      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:42,258 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:42,258 INFO  L82        PathProgramCache]: Analyzing trace with hash -1524081869, now seen corresponding path program 1 times
[2018-10-01 00:54:42,260 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:42,260 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:42,262 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:42,262 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:42,262 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:42,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:42,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:42,420 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:42,420 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-01 00:54:42,420 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:42,421 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:42,421 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:42,421 INFO  L87              Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states.
[2018-10-01 00:54:42,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:42,800 INFO  L93              Difference]: Finished difference Result 1113 states and 1434 transitions.
[2018-10-01 00:54:42,801 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:42,801 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2018-10-01 00:54:42,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:42,806 INFO  L225             Difference]: With dead ends: 1113
[2018-10-01 00:54:42,806 INFO  L226             Difference]: Without dead ends: 743
[2018-10-01 00:54:42,809 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:42,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 743 states.
[2018-10-01 00:54:42,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741.
[2018-10-01 00:54:42,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 741 states.
[2018-10-01 00:54:42,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions.
[2018-10-01 00:54:42,944 INFO  L78                 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30
[2018-10-01 00:54:42,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:42,945 INFO  L480      AbstractCegarLoop]: Abstraction has 741 states and 932 transitions.
[2018-10-01 00:54:42,945 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:42,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions.
[2018-10-01 00:54:42,951 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-10-01 00:54:42,954 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:42,954 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-01 00:54:42,955 INFO  L423      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:42,955 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:42,955 INFO  L82        PathProgramCache]: Analyzing trace with hash -714735243, now seen corresponding path program 1 times
[2018-10-01 00:54:42,956 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:42,956 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:42,957 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:42,957 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:42,960 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:42,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:43,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-01 00:54:43,172 INFO  L301   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-01 00:54:43,172 INFO  L227   ckRefinementStrategy]: Switched to mode Z3_FP
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-10-01 00:54:43,189 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:43,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:43,273 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-10-01 00:54:44,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-10-01 00:54:44,204 INFO  L313   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-01 00:54:44,204 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6
[2018-10-01 00:54:44,205 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-01 00:54:44,205 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-01 00:54:44,205 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:44,207 INFO  L87              Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states.
[2018-10-01 00:54:48,616 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:48,617 INFO  L93              Difference]: Finished difference Result 1609 states and 2019 transitions.
[2018-10-01 00:54:48,617 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2018-10-01 00:54:48,617 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 30
[2018-10-01 00:54:48,617 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:48,620 INFO  L225             Difference]: With dead ends: 1609
[2018-10-01 00:54:48,621 INFO  L226             Difference]: Without dead ends: 565
[2018-10-01 00:54:48,622 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time
[2018-10-01 00:54:48,623 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2018-10-01 00:54:48,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 515.
[2018-10-01 00:54:48,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 515 states.
[2018-10-01 00:54:48,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions.
[2018-10-01 00:54:48,724 INFO  L78                 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 30
[2018-10-01 00:54:48,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:48,725 INFO  L480      AbstractCegarLoop]: Abstraction has 515 states and 606 transitions.
[2018-10-01 00:54:48,725 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-01 00:54:48,725 INFO  L276                IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions.
[2018-10-01 00:54:48,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-10-01 00:54:48,727 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-01 00:54:48,727 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-10-01 00:54:48,728 INFO  L423      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-01 00:54:48,728 INFO  L99       BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-01 00:54:48,728 INFO  L82        PathProgramCache]: Analyzing trace with hash -1918843925, now seen corresponding path program 2 times
[2018-10-01 00:54:48,728 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-01 00:54:48,728 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-01 00:54:48,730 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:48,730 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-01 00:54:48,730 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-01 00:54:48,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-01 00:54:48,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-10-01 00:54:48,848 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-01 00:54:48,848 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-01 00:54:48,849 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-01 00:54:48,849 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-01 00:54:48,849 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker
[2018-10-01 00:54:48,849 INFO  L87              Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 3 states.
[2018-10-01 00:54:48,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-01 00:54:48,866 INFO  L93              Difference]: Finished difference Result 515 states and 606 transitions.
[2018-10-01 00:54:48,866 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-01 00:54:48,867 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 58
[2018-10-01 00:54:48,867 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-01 00:54:48,867 INFO  L225             Difference]: With dead ends: 515
[2018-10-01 00:54:48,867 INFO  L226             Difference]: Without dead ends: 0
[2018-10-01 00:54:48,868 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time
[2018-10-01 00:54:48,868 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-10-01 00:54:48,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-10-01 00:54:48,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-10-01 00:54:48,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-10-01 00:54:48,869 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58
[2018-10-01 00:54:48,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-01 00:54:48,869 INFO  L480      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-10-01 00:54:48,869 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-01 00:54:48,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-10-01 00:54:48,870 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-10-01 00:54:48,874 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-10-01 00:54:49,325 WARN  L178               SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 21
[2018-10-01 00:54:49,990 WARN  L178               SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42
[2018-10-01 00:54:50,293 WARN  L178               SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38
[2018-10-01 00:54:50,519 WARN  L178               SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38
[2018-10-01 00:54:50,696 WARN  L178               SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38
[2018-10-01 00:54:50,821 WARN  L178               SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33
[2018-10-01 00:54:51,047 WARN  L178               SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51
[2018-10-01 00:54:51,434 WARN  L178               SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42
[2018-10-01 00:54:51,998 WARN  L178               SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38
[2018-10-01 00:54:52,103 WARN  L178               SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38
[2018-10-01 00:54:52,281 WARN  L178               SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38
[2018-10-01 00:54:52,557 WARN  L178               SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51
[2018-10-01 00:54:52,757 WARN  L178               SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30
[2018-10-01 00:54:52,760 INFO  L422   ceAbstractionStarter]: At program point  L415(lines 409 416)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256))))))
[2018-10-01 00:54:52,761 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 463)  no Hoare annotation was computed.
[2018-10-01 00:54:52,761 INFO  L422   ceAbstractionStarter]: At program point  L461(lines 308 461)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2)))
[2018-10-01 00:54:52,761 INFO  L422   ceAbstractionStarter]: At program point  L395(lines 389 396)  the Hoare annotation is:  (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6)))
[2018-10-01 00:54:52,761 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startENTRY(lines 91 464)  no Hoare annotation was computed.
[2018-10-01 00:54:52,761 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 91 464)  no Hoare annotation was computed.
[2018-10-01 00:54:52,761 INFO  L422   ceAbstractionStarter]: At program point  L375(lines 369 376)  the Hoare annotation is:  (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6)))
[2018-10-01 00:54:52,762 INFO  L422   ceAbstractionStarter]: At program point  L400(lines 400 410)  the Hoare annotation is:  (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6)))
[2018-10-01 00:54:52,762 INFO  L422   ceAbstractionStarter]: At program point  L458(lines 458 462)  the Hoare annotation is:  false
[2018-10-01 00:54:52,762 INFO  L422   ceAbstractionStarter]: At program point  L355(lines 349 356)  the Hoare annotation is:  (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))
[2018-10-01 00:54:52,762 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 91 464)  no Hoare annotation was computed.
[2018-10-01 00:54:52,762 INFO  L422   ceAbstractionStarter]: At program point  L380(lines 380 390)  the Hoare annotation is:  (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6)))
[2018-10-01 00:54:52,763 INFO  L422   ceAbstractionStarter]: At program point  L442(lines 438 443)  the Hoare annotation is:  (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)))
[2018-10-01 00:54:52,763 INFO  L422   ceAbstractionStarter]: At program point  L335(lines 326 336)  the Hoare annotation is:  (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4)))
[2018-10-01 00:54:52,763 INFO  L422   ceAbstractionStarter]: At program point  L360(lines 360 370)  the Hoare annotation is:  (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))
[2018-10-01 00:54:52,763 INFO  L422   ceAbstractionStarter]: At program point  L315(lines 315 327)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2)))
[2018-10-01 00:54:52,764 INFO  L422   ceAbstractionStarter]: At program point  L340(lines 340 350)  the Hoare annotation is:  (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4)))
[2018-10-01 00:54:52,764 INFO  L422   ceAbstractionStarter]: At program point  L431(lines 431 439)  the Hoare annotation is:  (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse5)))
[2018-10-01 00:54:52,764 INFO  L422   ceAbstractionStarter]: At program point  L452(lines 452 459)  the Hoare annotation is:  (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg))
[2018-10-01 00:54:52,777 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,778 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,781 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,781 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,784 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,784 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,787 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,787 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,789 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,789 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,791 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,791 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,793 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,794 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,795 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,795 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,798 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,798 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,801 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,801 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,803 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,803 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,805 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,806 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,807 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,807 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,809 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,809 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,812 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,812 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,814 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,814 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,818 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,818 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,821 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,821 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,822 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,822 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,824 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,824 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,826 INFO  L202        PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:54:52 BoogieIcfgContainer
[2018-10-01 00:54:52,826 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-01 00:54:52,827 INFO  L168              Benchmark]: Toolchain (without parser) took 14276.40 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 51.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 275.0 MB). Peak memory consumption was 326.9 MB. Max. memory is 7.1 GB.
[2018-10-01 00:54:52,829 INFO  L168              Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-01 00:54:52,829 INFO  L168              Benchmark]: Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-01 00:54:52,830 INFO  L168              Benchmark]: Boogie Preprocessor took 47.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-01 00:54:52,830 INFO  L168              Benchmark]: RCFGBuilder took 725.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-10-01 00:54:52,831 INFO  L168              Benchmark]: TraceAbstraction took 13452.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 51.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.3 MB). Peak memory consumption was 295.2 MB. Max. memory is 7.1 GB.
[2018-10-01 00:54:52,836 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 47.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * RCFGBuilder took 725.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 13452.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 51.9 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.3 MB). Peak memory consumption was 295.2 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 463]: assertion always holds
    For all program executions holds that assertion always holds at this location
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 452]: Loop Invariant
    Derived loop invariant: (((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~130) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg
  - InvariantResult [Line: 349]: Loop Invariant
[2018-10-01 00:54:52,849 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,849 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,851 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,851 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))
  - InvariantResult [Line: 308]: Loop Invariant
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)
  - InvariantResult [Line: 369]: Loop Invariant
[2018-10-01 00:54:52,853 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,853 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,854 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,854 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)
  - InvariantResult [Line: 389]: Loop Invariant
[2018-10-01 00:54:52,855 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,856 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,857 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,857 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)
  - InvariantResult [Line: 458]: Loop Invariant
    Derived loop invariant: false
  - InvariantResult [Line: 409]: Loop Invariant
[2018-10-01 00:54:52,858 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,859 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,860 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,860 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))
  - InvariantResult [Line: 340]: Loop Invariant
[2018-10-01 00:54:52,865 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,866 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,867 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,867 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))
  - InvariantResult [Line: 360]: Loop Invariant
[2018-10-01 00:54:52,868 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,868 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,869 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,870 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))
  - InvariantResult [Line: 380]: Loop Invariant
[2018-10-01 00:54:52,870 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,871 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,874 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,874 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)
  - InvariantResult [Line: 315]: Loop Invariant
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)
  - InvariantResult [Line: 400]: Loop Invariant
[2018-10-01 00:54:52,876 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,876 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,877 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,877 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)
  - InvariantResult [Line: 438]: Loop Invariant
    Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= check_~tmp~130) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1
  - InvariantResult [Line: 326]: Loop Invariant
[2018-10-01 00:54:52,879 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,879 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,887 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,887 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))
  - InvariantResult [Line: 431]: Loop Invariant
[2018-10-01 00:54:52,888 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,888 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,889 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
[2018-10-01 00:54:52,889 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED]
    Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 13.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 238 SDslu, 219 SDs, 0 SdLazy, 187 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 325 NumberOfFragments, 1329 HoareAnnotationTreeSize, 15 FomulaSimplifications, 17278 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 248 ConstructedInterpolants, 10 QuantifiedInterpolants, 24454 SizeOfPredicates, 1 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 126/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-54-52-896.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-54-52-896.csv
Received shutdown request...