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.5.ufo.UNBOUNDED.pals.c_19.bpl


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


This is Ultimate 0.1.23-9f4048f
[2018-10-04 12:52:50,337 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-10-04 12:52:50,340 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-04 12:52:50,353 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-04 12:52:50,353 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-04 12:52:50,354 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-04 12:52:50,356 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-04 12:52:50,358 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-04 12:52:50,359 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-04 12:52:50,360 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-04 12:52:50,361 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-04 12:52:50,362 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-04 12:52:50,363 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-04 12:52:50,364 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-04 12:52:50,365 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-04 12:52:50,365 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-04 12:52:50,366 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-04 12:52:50,368 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-04 12:52:50,372 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-04 12:52:50,374 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-04 12:52:50,377 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-04 12:52:50,379 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-04 12:52:50,382 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-04 12:52:50,382 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-04 12:52:50,382 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-04 12:52:50,386 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-04 12:52:50,388 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-04 12:52:50,388 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-04 12:52:50,391 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-04 12:52:50,393 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-04 12:52:50,393 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-04 12:52:50,394 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-04 12:52:50,396 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-04 12:52:50,396 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-04 12:52:50,397 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-04 12:52:50,398 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-10-04 12:52:50,398 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-04 12:52:50,430 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-10-04 12:52:50,430 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-04 12:52:50,431 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-04 12:52:50,431 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-10-04 12:52:50,433 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-04 12:52:50,433 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-10-04 12:52:50,433 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-10-04 12:52:50,433 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-04 12:52:50,434 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-10-04 12:52:50,434 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-10-04 12:52:50,434 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-10-04 12:52:50,434 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-10-04 12:52:50,434 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-10-04 12:52:50,435 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-04 12:52:50,435 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-10-04 12:52:50,435 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-10-04 12:52:50,435 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-10-04 12:52:50,435 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-10-04 12:52:50,436 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-04 12:52:50,436 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-10-04 12:52:50,436 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-10-04 12:52:50,436 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-10-04 12:52:50,437 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-04 12:52:50,437 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-04 12:52:50,437 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-10-04 12:52:50,437 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-04 12:52:50,437 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-10-04 12:52:50,438 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-04 12:52:50,438 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-04 12:52:50,438 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-04 12:52:50,438 INFO  L133        SettingsManager]:  * Use predicate trie based predicate unification=true
[2018-10-04 12:52:50,495 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-04 12:52:50,511 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-04 12:52:50,517 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-04 12:52:50,519 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-10-04 12:52:50,520 INFO  L276        PluginConnector]: Boogie PL CUP Parser initialized
[2018-10-04 12:52:50,521 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl
[2018-10-04 12:52:50,521 INFO  L111           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl'
[2018-10-04 12:52:50,631 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-04 12:52:50,633 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-10-04 12:52:50,634 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-04 12:52:50,634 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-04 12:52:50,635 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-04 12:52:50,655 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,679 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,688 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-04 12:52:50,689 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-04 12:52:50,689 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-04 12:52:50,690 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-10-04 12:52:50,701 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,701 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,707 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,707 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,725 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,728 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,730 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/1) ...
[2018-10-04 12:52:50,734 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-04 12:52:50,735 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-04 12:52:50,735 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-10-04 12:52:50,735 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-10-04 12:52:50,736 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (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-04 12:52:50,802 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-10-04 12:52:50,802 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-10-04 12:52:51,472 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-10-04 12:52:51,472 INFO  L202        PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:51 BoogieIcfgContainer
[2018-10-04 12:52:51,473 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-04 12:52:51,474 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-04 12:52:51,474 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-10-04 12:52:51,478 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-10-04 12:52:51,479 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:50" (1/2) ...
[2018-10-04 12:52:51,480 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123635d3 and model type pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:52:51, skipping insertion in model container
[2018-10-04 12:52:51,480 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:51" (2/2) ...
[2018-10-04 12:52:51,482 INFO  L112   eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl
[2018-10-04 12:52:51,492 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-04 12:52:51,503 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-10-04 12:52:51,549 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-10-04 12:52:51,550 INFO  L381      AbstractCegarLoop]: Interprodecural is true
[2018-10-04 12:52:51,550 INFO  L382      AbstractCegarLoop]: Hoare is true
[2018-10-04 12:52:51,550 INFO  L383      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-04 12:52:51,551 INFO  L384      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-04 12:52:51,551 INFO  L385      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-04 12:52:51,551 INFO  L386      AbstractCegarLoop]: Difference is false
[2018-10-04 12:52:51,551 INFO  L387      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-04 12:52:51,551 INFO  L392      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-04 12:52:51,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 20 states.
[2018-10-04 12:52:51,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-10-04 12:52:51,574 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:51,575 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:52:51,576 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:51,583 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:51,584 INFO  L82        PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times
[2018-10-04 12:52:51,586 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:51,587 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:51,646 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:51,647 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:51,647 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:51,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:51,831 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-04 12:52:51,833 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:51,834 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-04 12:52:51,838 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-04 12:52:51,851 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-04 12:52:51,851 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:51,853 INFO  L87              Difference]: Start difference. First operand 20 states. Second operand 3 states.
[2018-10-04 12:52:51,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:51,909 INFO  L93              Difference]: Finished difference Result 54 states and 77 transitions.
[2018-10-04 12:52:51,910 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-04 12:52:51,911 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-10-04 12:52:51,912 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:51,930 INFO  L225             Difference]: With dead ends: 54
[2018-10-04 12:52:51,930 INFO  L226             Difference]: Without dead ends: 35
[2018-10-04 12:52:51,935 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1
[2018-10-04 12:52:51,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2018-10-04 12:52:51,981 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2018-10-04 12:52:51,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2018-10-04 12:52:51,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions.
[2018-10-04 12:52:51,985 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17
[2018-10-04 12:52:51,986 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:51,986 INFO  L480      AbstractCegarLoop]: Abstraction has 33 states and 47 transitions.
[2018-10-04 12:52:51,986 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-04 12:52:51,986 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions.
[2018-10-04 12:52:51,987 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-10-04 12:52:51,987 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:51,987 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:52:51,988 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:51,988 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:51,988 INFO  L82        PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times
[2018-10-04 12:52:51,988 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:51,988 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:51,992 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:51,992 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:51,992 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:52,136 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-04 12:52:52,137 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:52,137 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-04 12:52:52,139 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-04 12:52:52,139 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-04 12:52:52,139 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:52,140 INFO  L87              Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states.
[2018-10-04 12:52:52,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:52,187 INFO  L93              Difference]: Finished difference Result 97 states and 139 transitions.
[2018-10-04 12:52:52,187 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-04 12:52:52,188 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-10-04 12:52:52,188 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:52,189 INFO  L225             Difference]: With dead ends: 97
[2018-10-04 12:52:52,189 INFO  L226             Difference]: Without dead ends: 65
[2018-10-04 12:52:52,191 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1
[2018-10-04 12:52:52,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-10-04 12:52:52,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63.
[2018-10-04 12:52:52,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-10-04 12:52:52,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions.
[2018-10-04 12:52:52,210 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17
[2018-10-04 12:52:52,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:52,211 INFO  L480      AbstractCegarLoop]: Abstraction has 63 states and 90 transitions.
[2018-10-04 12:52:52,211 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-04 12:52:52,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions.
[2018-10-04 12:52:52,212 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-10-04 12:52:52,212 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:52,212 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:52:52,212 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:52,212 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:52,213 INFO  L82        PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times
[2018-10-04 12:52:52,213 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:52,213 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:52,216 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,216 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:52,216 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:52,339 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-04 12:52:52,340 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:52,340 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-04 12:52:52,340 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-04 12:52:52,341 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-04 12:52:52,341 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:52,341 INFO  L87              Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states.
[2018-10-04 12:52:52,400 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:52,401 INFO  L93              Difference]: Finished difference Result 187 states and 268 transitions.
[2018-10-04 12:52:52,401 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-04 12:52:52,402 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-10-04 12:52:52,402 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:52,406 INFO  L225             Difference]: With dead ends: 187
[2018-10-04 12:52:52,406 INFO  L226             Difference]: Without dead ends: 125
[2018-10-04 12:52:52,407 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1
[2018-10-04 12:52:52,407 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2018-10-04 12:52:52,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123.
[2018-10-04 12:52:52,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 123 states.
[2018-10-04 12:52:52,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions.
[2018-10-04 12:52:52,466 INFO  L78                 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17
[2018-10-04 12:52:52,469 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:52,469 INFO  L480      AbstractCegarLoop]: Abstraction has 123 states and 174 transitions.
[2018-10-04 12:52:52,470 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-04 12:52:52,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions.
[2018-10-04 12:52:52,470 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-10-04 12:52:52,470 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:52,471 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:52:52,471 INFO  L423      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:52,471 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:52,472 INFO  L82        PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times
[2018-10-04 12:52:52,472 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:52,472 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:52,474 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,475 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:52,475 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:52,594 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-04 12:52:52,594 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:52,594 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-04 12:52:52,595 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-04 12:52:52,595 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-04 12:52:52,595 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:52,596 INFO  L87              Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states.
[2018-10-04 12:52:52,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:52,677 INFO  L93              Difference]: Finished difference Result 367 states and 520 transitions.
[2018-10-04 12:52:52,678 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-04 12:52:52,678 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-10-04 12:52:52,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:52,682 INFO  L225             Difference]: With dead ends: 367
[2018-10-04 12:52:52,682 INFO  L226             Difference]: Without dead ends: 245
[2018-10-04 12:52:52,683 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1
[2018-10-04 12:52:52,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-10-04 12:52:52,746 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243.
[2018-10-04 12:52:52,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 243 states.
[2018-10-04 12:52:52,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions.
[2018-10-04 12:52:52,754 INFO  L78                 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17
[2018-10-04 12:52:52,754 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:52,755 INFO  L480      AbstractCegarLoop]: Abstraction has 243 states and 338 transitions.
[2018-10-04 12:52:52,755 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-04 12:52:52,755 INFO  L276                IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions.
[2018-10-04 12:52:52,756 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-10-04 12:52:52,756 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:52,756 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:52:52,756 INFO  L423      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:52,756 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:52,758 INFO  L82        PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times
[2018-10-04 12:52:52,758 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:52,758 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:52,760 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,760 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:52,760 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:52,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:52,903 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-04 12:52:52,903 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:52,904 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-04 12:52:52,904 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-04 12:52:52,904 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-04 12:52:52,905 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:52,905 INFO  L87              Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states.
[2018-10-04 12:52:53,198 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:53,199 INFO  L93              Difference]: Finished difference Result 517 states and 707 transitions.
[2018-10-04 12:52:53,199 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-10-04 12:52:53,199 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2018-10-04 12:52:53,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:53,203 INFO  L225             Difference]: With dead ends: 517
[2018-10-04 12:52:53,204 INFO  L226             Difference]: Without dead ends: 515
[2018-10-04 12:52:53,204 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3
[2018-10-04 12:52:53,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2018-10-04 12:52:53,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275.
[2018-10-04 12:52:53,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 275 states.
[2018-10-04 12:52:53,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions.
[2018-10-04 12:52:53,296 INFO  L78                 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17
[2018-10-04 12:52:53,297 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:53,297 INFO  L480      AbstractCegarLoop]: Abstraction has 275 states and 370 transitions.
[2018-10-04 12:52:53,297 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-04 12:52:53,297 INFO  L276                IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions.
[2018-10-04 12:52:53,298 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-10-04 12:52:53,298 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:53,298 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:52:53,298 INFO  L423      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:53,299 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:53,299 INFO  L82        PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times
[2018-10-04 12:52:53,299 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:53,299 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:53,301 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:53,301 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:53,302 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:53,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:53,531 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-04 12:52:53,532 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:53,532 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-04 12:52:53,532 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-04 12:52:53,533 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-04 12:52:53,533 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:53,534 INFO  L87              Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states.
[2018-10-04 12:52:53,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:53,828 INFO  L93              Difference]: Finished difference Result 879 states and 1193 transitions.
[2018-10-04 12:52:53,829 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-04 12:52:53,829 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2018-10-04 12:52:53,829 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:53,834 INFO  L225             Difference]: With dead ends: 879
[2018-10-04 12:52:53,834 INFO  L226             Difference]: Without dead ends: 605
[2018-10-04 12:52:53,835 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2
[2018-10-04 12:52:53,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 605 states.
[2018-10-04 12:52:53,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605.
[2018-10-04 12:52:53,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 605 states.
[2018-10-04 12:52:53,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions.
[2018-10-04 12:52:53,958 INFO  L78                 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17
[2018-10-04 12:52:53,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:53,958 INFO  L480      AbstractCegarLoop]: Abstraction has 605 states and 776 transitions.
[2018-10-04 12:52:53,958 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-04 12:52:53,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions.
[2018-10-04 12:52:53,969 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-10-04 12:52:53,970 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:53,970 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-10-04 12:52:53,970 INFO  L423      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:53,970 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:53,972 INFO  L82        PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times
[2018-10-04 12:52:53,972 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:53,972 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:53,974 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:53,975 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:53,975 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:54,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:54,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2018-10-04 12:52:54,147 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:54,147 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-04 12:52:54,148 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-04 12:52:54,148 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-04 12:52:54,148 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:54,148 INFO  L87              Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states.
[2018-10-04 12:52:54,428 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:54,429 INFO  L93              Difference]: Finished difference Result 1809 states and 2322 transitions.
[2018-10-04 12:52:54,429 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-04 12:52:54,430 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 62
[2018-10-04 12:52:54,430 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:54,439 INFO  L225             Difference]: With dead ends: 1809
[2018-10-04 12:52:54,439 INFO  L226             Difference]: Without dead ends: 1207
[2018-10-04 12:52:54,443 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1
[2018-10-04 12:52:54,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1207 states.
[2018-10-04 12:52:54,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205.
[2018-10-04 12:52:54,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1205 states.
[2018-10-04 12:52:54,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions.
[2018-10-04 12:52:54,692 INFO  L78                 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62
[2018-10-04 12:52:54,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:54,693 INFO  L480      AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions.
[2018-10-04 12:52:54,693 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-04 12:52:54,693 INFO  L276                IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions.
[2018-10-04 12:52:54,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-10-04 12:52:54,699 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:54,700 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-10-04 12:52:54,700 INFO  L423      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:54,700 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:54,700 INFO  L82        PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times
[2018-10-04 12:52:54,701 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:54,705 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:54,708 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:54,708 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:54,708 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:54,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:55,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2018-10-04 12:52:55,163 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:52:55,163 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-04 12:52:55,189 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:55,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:55,345 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:52:56,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2018-10-04 12:52:56,279 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:52:56,280 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2018-10-04 12:52:56,280 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-04 12:52:56,280 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-04 12:52:56,281 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:56,283 INFO  L87              Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 7 states.
[2018-10-04 12:52:58,245 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:58,245 INFO  L93              Difference]: Finished difference Result 1889 states and 2370 transitions.
[2018-10-04 12:52:58,245 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-10-04 12:52:58,246 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 62
[2018-10-04 12:52:58,246 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:58,253 INFO  L225             Difference]: With dead ends: 1889
[2018-10-04 12:52:58,253 INFO  L226             Difference]: Without dead ends: 991
[2018-10-04 12:52:58,255 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.5s impTime 8
[2018-10-04 12:52:58,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 991 states.
[2018-10-04 12:52:58,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 725.
[2018-10-04 12:52:58,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 725 states.
[2018-10-04 12:52:58,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 892 transitions.
[2018-10-04 12:52:58,488 INFO  L78                 Accepts]: Start accepts. Automaton has 725 states and 892 transitions. Word has length 62
[2018-10-04 12:52:58,488 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:58,488 INFO  L480      AbstractCegarLoop]: Abstraction has 725 states and 892 transitions.
[2018-10-04 12:52:58,489 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-04 12:52:58,489 INFO  L276                IsEmpty]: Start isEmpty. Operand 725 states and 892 transitions.
[2018-10-04 12:52:58,490 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-10-04 12:52:58,491 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-04 12:52:58,491 INFO  L375         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-10-04 12:52:58,491 INFO  L423      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:52:58,491 INFO  L108      BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-04 12:52:58,492 INFO  L82        PathProgramCache]: Analyzing trace with hash 1342683145, now seen corresponding path program 2 times
[2018-10-04 12:52:58,492 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:52:58,493 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:52:58,494 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:58,495 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:52:58,495 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:52:58,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:52:58,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2018-10-04 12:52:58,615 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:52:58,615 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-04 12:52:58,616 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-04 12:52:58,616 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-04 12:52:58,616 INFO  L146   InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-04 12:52:58,616 INFO  L87              Difference]: Start difference. First operand 725 states and 892 transitions. Second operand 3 states.
[2018-10-04 12:52:58,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:52:58,659 INFO  L93              Difference]: Finished difference Result 749 states and 917 transitions.
[2018-10-04 12:52:58,659 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-04 12:52:58,660 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 77
[2018-10-04 12:52:58,660 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:52:58,660 INFO  L225             Difference]: With dead ends: 749
[2018-10-04 12:52:58,660 INFO  L226             Difference]: Without dead ends: 0
[2018-10-04 12:52:58,661 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1
[2018-10-04 12:52:58,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-10-04 12:52:58,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-10-04 12:52:58,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-10-04 12:52:58,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-10-04 12:52:58,662 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77
[2018-10-04 12:52:58,662 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:52:58,662 INFO  L480      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-10-04 12:52:58,663 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-04 12:52:58,663 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-10-04 12:52:58,663 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-10-04 12:52:58,668 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-10-04 12:52:58,699 WARN  L250   erpolLogProxyWrapper]: Already inconsistent.
[2018-10-04 12:52:59,481 WARN  L178               SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44
[2018-10-04 12:52:59,693 WARN  L178               SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27
[2018-10-04 12:52:59,805 WARN  L178               SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 22
[2018-10-04 12:53:00,326 WARN  L178               SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44
[2018-10-04 12:53:00,619 WARN  L178               SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29
[2018-10-04 12:53:00,807 WARN  L178               SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27
[2018-10-04 12:53:00,881 INFO  L421   ceAbstractionStarter]: At program point  L320(lines 313 321)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,882 INFO  L421   ceAbstractionStarter]: At program point  L411(lines 407 418)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,882 INFO  L421   ceAbstractionStarter]: At program point  L279(lines 279 291)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send5)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= ~send5 127))) (or (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (= .cse3 ~p5_old) (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 .cse4)))
[2018-10-04 12:53:00,882 INFO  L421   ceAbstractionStarter]: At program point  L432(lines 432 439)  the Hoare annotation is:  (and (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,883 INFO  L421   ceAbstractionStarter]: At program point  L325(lines 325 335)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,883 INFO  L425   ceAbstractionStarter]: For program point  ULTIMATE.startENTRY(lines 81 444)  no Hoare annotation was computed.
[2018-10-04 12:53:00,883 INFO  L425   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 81 444)  no Hoare annotation was computed.
[2018-10-04 12:53:00,883 INFO  L421   ceAbstractionStarter]: At program point  L441(lines 272 441)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send5)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= ~send5 127))) (or (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (= .cse3 ~p5_old) (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4) (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 .cse4)))
[2018-10-04 12:53:00,883 INFO  L421   ceAbstractionStarter]: At program point  L342(lines 334 343)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,883 INFO  L425   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 81 444)  no Hoare annotation was computed.
[2018-10-04 12:53:00,884 INFO  L425   ceAbstractionStarter]: For program point  ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443)  no Hoare annotation was computed.
[2018-10-04 12:53:00,884 INFO  L421   ceAbstractionStarter]: At program point  L347(lines 347 357)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,884 INFO  L421   ceAbstractionStarter]: At program point  L438(lines 438 442)  the Hoare annotation is:  false
[2018-10-04 12:53:00,884 INFO  L421   ceAbstractionStarter]: At program point  L364(lines 356 365)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,884 INFO  L421   ceAbstractionStarter]: At program point  L298(lines 290 299)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,885 INFO  L421   ceAbstractionStarter]: At program point  L422(lines 417 423)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,885 INFO  L421   ceAbstractionStarter]: At program point  L402(lines 402 408)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,885 INFO  L421   ceAbstractionStarter]: At program point  L369(lines 369 379)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,885 INFO  L421   ceAbstractionStarter]: At program point  L303(lines 303 314)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-10-04 12:53:00,885 INFO  L421   ceAbstractionStarter]: At program point  L386(lines 378 387)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p5_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~send5 127))
[2018-10-04 12:53:00,900 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,901 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,901 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,902 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,904 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,905 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,905 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,905 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,906 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,907 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,907 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,907 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,908 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,909 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,909 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,909 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,913 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,913 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,913 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,913 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,914 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,915 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,915 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,915 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,917 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,917 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,917 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,918 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,919 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,920 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,920 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,920 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,922 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,922 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,922 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,922 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,923 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,924 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,924 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,924 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,926 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,926 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,926 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,926 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,927 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,928 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,928 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,928 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,929 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,930 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,930 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,930 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,931 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,931 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,932 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,932 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,935 INFO  L202        PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:00 BoogieIcfgContainer
[2018-10-04 12:53:00,935 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-04 12:53:00,938 INFO  L168              Benchmark]: Toolchain (without parser) took 10306.26 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 250.7 MB). Peak memory consumption was 284.3 MB. Max. memory is 7.1 GB.
[2018-10-04 12:53:00,940 INFO  L168              Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-04 12:53:00,941 INFO  L168              Benchmark]: Boogie Procedure Inliner took 54.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-04 12:53:00,941 INFO  L168              Benchmark]: Boogie Preprocessor took 45.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-04 12:53:00,942 INFO  L168              Benchmark]: RCFGBuilder took 737.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
[2018-10-04 12:53:00,943 INFO  L168              Benchmark]: TraceAbstraction took 9461.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 219.0 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB.
[2018-10-04 12:53:00,948 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 54.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 45.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * RCFGBuilder took 737.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 9461.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 219.0 MB). Peak memory consumption was 252.6 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_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 443]: 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: 303]: Loop Invariant
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 272]: Loop Invariant
[2018-10-04 12:53:00,961 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,961 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,962 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,962 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,963 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,963 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,963 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,964 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127)
  - InvariantResult [Line: 378]: Loop Invariant
[2018-10-04 12:53:00,964 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,965 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,965 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,965 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,966 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,966 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,966 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,966 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127
  - InvariantResult [Line: 356]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 334]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 438]: Loop Invariant
    Derived loop invariant: false
  - InvariantResult [Line: 313]: Loop Invariant
    Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 290]: Loop Invariant
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 402]: Loop Invariant
[2018-10-04 12:53:00,969 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,969 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,969 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,969 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,970 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,970 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,971 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,971 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 279]: Loop Invariant
[2018-10-04 12:53:00,972 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,972 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,972 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,972 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,973 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,974 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,974 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,974 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127)
  - InvariantResult [Line: 369]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 417]: Loop Invariant
[2018-10-04 12:53:00,975 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,975 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,976 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,976 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,976 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,977 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,977 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,977 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 347]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 407]: Loop Invariant
[2018-10-04 12:53:00,978 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,978 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,978 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,978 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,979 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,979 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,979 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,979 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 432]: Loop Invariant
[2018-10-04 12:53:00,980 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,980 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,980 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,981 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,981 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,981 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,982 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-10-04 12:53:00,982 WARN  L390   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: ((((((((assert_~arg <= 1 && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 325]: Loop Invariant
    Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 9.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 213 SDslu, 218 SDs, 0 SdLazy, 138 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred 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.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 516 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 708 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1326 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 147 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 355 ConstructedInterpolants, 7 QuantifiedInterpolants, 96978 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 416/420 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.5.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-00-988.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-00-988.csv
Received shutdown request...