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_overflow.ufo.UNBOUNDED.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:53:25,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:25,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:25,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:25,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:25,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:25,059 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:25,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:25,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:25,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:25,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:25,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:25,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:25,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:25,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:25,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:25,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:25,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:25,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:25,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:25,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:25,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:25,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:25,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:25,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:25,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:25,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:25,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:25,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:25,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:25,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:25,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:25,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:25,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:25,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:25,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:25,112 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-09-26 21:53:25,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:25,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:25,137 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:25,137 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:25,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:25,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:25,138 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:25,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:25,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:25,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:25,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:25,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:25,139 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:25,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:25,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:25,140 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:25,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:25,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:25,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:25,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:25,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:25,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:25,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:25,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:25,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:25,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:25,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:25,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:25,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:25,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:25,143 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:25,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:25,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:25,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:25,205 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:25,205 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:25,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-09-26 21:53:25,207 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl' [2018-09-26 21:53:25,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:25,282 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:25,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:25,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:25,284 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:25,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:25,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:25,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:25,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:25,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/1) ... [2018-09-26 21:53:25,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:25,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:25,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:25,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:25,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (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-09-26 21:53:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:25,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:26,092 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:26,092 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:26 BoogieIcfgContainer [2018-09-26 21:53:26,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:26,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:26,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:26,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:26,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:25" (1/2) ... [2018-09-26 21:53:26,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2698b870 and model type pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:26, skipping insertion in model container [2018-09-26 21:53:26,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:26" (2/2) ... [2018-09-26 21:53:26,105 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-09-26 21:53:26,115 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:26,128 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:26,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:26,192 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:26,192 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:26,194 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:26,194 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:26,194 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:26,195 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:26,195 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:26,195 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-26 21:53:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:26,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:26,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:26,238 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:26,250 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-09-26 21:53:26,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:26,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:26,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:26,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:26,610 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:26,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:26,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:26,631 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:26,633 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-26 21:53:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:26,722 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-09-26 21:53:26,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:53:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:26,737 INFO L225 Difference]: With dead ends: 54 [2018-09-26 21:53:26,737 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 21:53:26,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 21:53:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-09-26 21:53:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:53:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-09-26 21:53:26,783 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-09-26 21:53:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:26,784 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-09-26 21:53:26,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-09-26 21:53:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:26,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:26,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:26,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:26,786 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-09-26 21:53:26,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:26,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:26,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:26,888 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:26,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:26,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:26,891 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-09-26 21:53:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:26,967 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-09-26 21:53:26,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:26,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:53:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:26,969 INFO L225 Difference]: With dead ends: 97 [2018-09-26 21:53:26,969 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 21:53:26,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 21:53:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-26 21:53:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 21:53:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-09-26 21:53:26,988 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-09-26 21:53:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:26,991 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-09-26 21:53:26,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-09-26 21:53:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:26,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:26,992 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:26,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:26,993 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-09-26 21:53:26,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:26,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:27,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:27,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:27,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:27,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:27,171 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:27,171 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-09-26 21:53:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:27,270 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-09-26 21:53:27,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:27,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:53:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:27,280 INFO L225 Difference]: With dead ends: 187 [2018-09-26 21:53:27,280 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 21:53:27,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 21:53:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-09-26 21:53:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 21:53:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-09-26 21:53:27,320 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-09-26 21:53:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:27,320 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-09-26 21:53:27,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-09-26 21:53:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:27,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:27,322 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:27,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:27,326 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-09-26 21:53:27,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:27,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:27,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:27,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:27,401 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:27,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:27,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:27,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:27,403 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-09-26 21:53:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:27,516 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-09-26 21:53:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:27,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:53:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:27,524 INFO L225 Difference]: With dead ends: 367 [2018-09-26 21:53:27,524 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 21:53:27,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 21:53:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-09-26 21:53:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 21:53:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-09-26 21:53:27,594 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-09-26 21:53:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:27,595 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-09-26 21:53:27,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-09-26 21:53:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:27,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:27,596 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:27,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:27,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:27,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-09-26 21:53:27,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:27,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:27,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:27,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:53:27,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:27,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:27,763 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-09-26 21:53:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:28,207 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-09-26 21:53:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:53:28,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-26 21:53:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:28,216 INFO L225 Difference]: With dead ends: 517 [2018-09-26 21:53:28,216 INFO L226 Difference]: Without dead ends: 515 [2018-09-26 21:53:28,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-26 21:53:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-09-26 21:53:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 21:53:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-09-26 21:53:28,296 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-09-26 21:53:28,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:28,297 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-09-26 21:53:28,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-09-26 21:53:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:28,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:28,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:28,299 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:28,300 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-09-26 21:53:28,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:28,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:28,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:28,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:28,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:28,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:28,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:28,549 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-09-26 21:53:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:29,458 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-09-26 21:53:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:53:29,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-26 21:53:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:29,463 INFO L225 Difference]: With dead ends: 879 [2018-09-26 21:53:29,463 INFO L226 Difference]: Without dead ends: 605 [2018-09-26 21:53:29,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-09-26 21:53:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-09-26 21:53:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-09-26 21:53:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-09-26 21:53:29,582 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-09-26 21:53:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:29,583 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-09-26 21:53:29,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-09-26 21:53:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 21:53:29,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:29,593 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-09-26 21:53:29,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:29,593 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-09-26 21:53:29,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:29,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:29,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:29,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-26 21:53:29,741 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:29,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:29,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:29,742 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:29,742 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-09-26 21:53:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:30,094 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-09-26 21:53:30,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:30,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-09-26 21:53:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:30,102 INFO L225 Difference]: With dead ends: 1809 [2018-09-26 21:53:30,102 INFO L226 Difference]: Without dead ends: 1207 [2018-09-26 21:53:30,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-26 21:53:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-26 21:53:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-26 21:53:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-09-26 21:53:30,323 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-09-26 21:53:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:30,323 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-09-26 21:53:30,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-09-26 21:53:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 21:53:30,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:30,330 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-09-26 21:53:30,330 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:30,330 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-09-26 21:53:30,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:30,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-26 21:53:30,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:30,800 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-09-26 21:53:30,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:30,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-26 21:53:32,172 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:32,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-26 21:53:32,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:53:32,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:53:32,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:32,174 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-09-26 21:53:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,235 INFO L93 Difference]: Finished difference Result 2024 states and 2520 transitions. [2018-09-26 21:53:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:53:39,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-09-26 21:53:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,245 INFO L225 Difference]: With dead ends: 2024 [2018-09-26 21:53:39,245 INFO L226 Difference]: Without dead ends: 565 [2018-09-26 21:53:39,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-09-26 21:53:39,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2018-09-26 21:53:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-09-26 21:53:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 442 transitions. [2018-09-26 21:53:39,468 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 442 transitions. Word has length 62 [2018-09-26 21:53:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:39,468 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 442 transitions. [2018-09-26 21:53:39,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:53:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 442 transitions. [2018-09-26 21:53:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 21:53:39,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:39,470 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-09-26 21:53:39,470 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:39,470 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-09-26 21:53:39,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-09-26 21:53:39,571 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:39,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:39,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:39,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:39,572 INFO L87 Difference]: Start difference. First operand 378 states and 442 transitions. Second operand 3 states. [2018-09-26 21:53:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,583 INFO L93 Difference]: Finished difference Result 384 states and 448 transitions. [2018-09-26 21:53:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:39,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-26 21:53:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,583 INFO L225 Difference]: With dead ends: 384 [2018-09-26 21:53:39,583 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:53:39,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:53:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:53:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:53:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:53:39,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-09-26 21:53:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:39,585 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:53:39,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:53:39,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:53:39,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:53:39,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:39,705 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2018-09-26 21:53:40,039 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2018-09-26 21:53:40,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:40,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:40,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:40,597 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2018-09-26 21:53:41,820 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2018-09-26 21:53:42,206 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-09-26 21:53:42,927 WARN L178 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2018-09-26 21:53:43,279 WARN L178 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-09-26 21:53:44,371 WARN L178 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 128 DAG size of output: 58 [2018-09-26 21:53:44,688 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-09-26 21:53:44,986 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2018-09-26 21:53:45,336 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-09-26 21:53:45,600 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-09-26 21:53:45,982 WARN L178 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-09-26 21:53:46,314 WARN L178 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-09-26 21:53:46,760 WARN L178 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2018-09-26 21:53:48,639 WARN L178 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 128 DAG size of output: 58 [2018-09-26 21:53:48,921 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-09-26 21:53:49,248 WARN L178 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2018-09-26 21:53:49,251 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 442) no Hoare annotation was computed. [2018-09-26 21:53:49,251 INFO L422 ceAbstractionStarter]: At program point L440(lines 272 440) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-09-26 21:53:49,251 INFO L422 ceAbstractionStarter]: At program point L279(lines 279 290) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-09-26 21:53:49,252 INFO L422 ceAbstractionStarter]: At program point L341(lines 333 342) the Hoare annotation is: (let ((.cse5 (* 256 (div ~r1 256)))) (let ((.cse8 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (<= 1 ~mode4)) (.cse10 (<= ~mode4 1)) (.cse13 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (= .cse14 ~p5_old) (<= .cse14 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse12 (<= ~r1 (+ .cse5 4))) (.cse11 (not (= ~p3_old ~nomsg))) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (<= ~send5 127))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6 .cse7) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse9 .cse8 .cse2 .cse10 .cse11 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse6 .cse7)))) [2018-09-26 21:53:49,252 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 443) no Hoare annotation was computed. [2018-09-26 21:53:49,252 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 443) no Hoare annotation was computed. [2018-09-26 21:53:49,252 INFO L422 ceAbstractionStarter]: At program point L346(lines 346 356) the Hoare annotation is: (let ((.cse5 (* 256 (div ~r1 256)))) (let ((.cse8 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (<= 1 ~mode4)) (.cse10 (<= ~mode4 1)) (.cse13 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (= .cse14 ~p5_old) (<= .cse14 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse12 (<= ~r1 (+ .cse5 4))) (.cse11 (not (= ~p3_old ~nomsg))) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (<= ~send5 127))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6 .cse7) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse9 .cse8 .cse2 .cse10 .cse11 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse6 .cse7)))) [2018-09-26 21:53:49,252 INFO L422 ceAbstractionStarter]: At program point L437(lines 437 441) the Hoare annotation is: false [2018-09-26 21:53:49,252 INFO L422 ceAbstractionStarter]: At program point L363(lines 355 364) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse7 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse5 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse6 (<= 0 ~send5)) (.cse8 (<= ~mode4 1)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse3 (<= ~r1 .cse12) .cse4 .cse10)))) [2018-09-26 21:53:49,253 INFO L422 ceAbstractionStarter]: At program point L297(lines 289 298) the Hoare annotation is: (let ((.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse5 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse7 .cse8))) [2018-09-26 21:53:49,253 INFO L422 ceAbstractionStarter]: At program point L421(lines 416 422) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (<= 0 ~send5)) (.cse5 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~mode5 (* 256 (div ~mode5 256))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10))) [2018-09-26 21:53:49,253 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 443) no Hoare annotation was computed. [2018-09-26 21:53:49,253 INFO L422 ceAbstractionStarter]: At program point L401(lines 401 407) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse4 (<= ~mode4 1)) (.cse5 (not (= ~p3_old ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8))) [2018-09-26 21:53:49,254 INFO L422 ceAbstractionStarter]: At program point L368(lines 368 378) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse7 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse5 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse6 (<= 0 ~send5)) (.cse8 (<= ~mode4 1)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse3 (<= ~r1 .cse12) .cse4 .cse10)))) [2018-09-26 21:53:49,254 INFO L422 ceAbstractionStarter]: At program point L302(lines 302 313) the Hoare annotation is: (let ((.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse5 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse7 .cse8))) [2018-09-26 21:53:49,254 INFO L422 ceAbstractionStarter]: At program point L385(lines 377 386) the Hoare annotation is: (let ((.cse10 (* 256 (div ~r1 256))) (.cse11 (+ ~nomsg 1))) (let ((.cse5 (and (= .cse11 0) (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 256))) (and (= ~p5_new .cse13) (<= .cse13 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (<= 0 ~send3)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ .cse10 4))) (.cse4 (<= ~mode4 1)) (.cse6 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (<= ~r1 .cse10) .cse8 .cse9) (and .cse0 .cse1 .cse7 (= 0 .cse11) .cse8 (= ~mode5 (* 256 (div ~mode5 256))) .cse2 .cse3 .cse4 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (= .cse12 ~p5_old) (<= .cse12 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse9)))) [2018-09-26 21:53:49,255 INFO L422 ceAbstractionStarter]: At program point L319(lines 312 320) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-09-26 21:53:49,255 INFO L422 ceAbstractionStarter]: At program point L410(lines 406 417) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse4 (<= ~mode4 1)) (.cse5 (not (= ~p3_old ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8))) [2018-09-26 21:53:49,255 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 438) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (= ULTIMATE.start_assert_~arg 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= 0 ~send5)) (.cse6 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse7 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse8 (<= ~mode4 1)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~mode5 (* 256 (div ~mode5 256))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10))) [2018-09-26 21:53:49,255 INFO L422 ceAbstractionStarter]: At program point L324(lines 324 334) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-09-26 21:53:49,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,301 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,301 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,301 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,310 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,311 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,315 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,317 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,317 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,319 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,321 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,324 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,330 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,330 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,330 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,330 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,331 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,332 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,332 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,332 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,334 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,335 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,337 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,337 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,337 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,345 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,346 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,346 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,346 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,348 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,348 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,349 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,349 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,350 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,350 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,350 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,350 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,352 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:53:49 BoogieIcfgContainer [2018-09-26 21:53:49,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:49,353 INFO L168 Benchmark]: Toolchain (without parser) took 24073.58 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 362.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -225.7 MB). Peak memory consumption was 748.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:49,355 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:49,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:49,356 INFO L168 Benchmark]: Boogie Preprocessor took 37.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:49,356 INFO L168 Benchmark]: RCFGBuilder took 723.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:49,358 INFO L168 Benchmark]: TraceAbstraction took 23259.13 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 362.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -257.4 MB). Peak memory consumption was 716.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:49,362 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 723.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23259.13 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 362.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -257.4 MB). Peak memory consumption was 716.9 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] - 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] - 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: 442]: 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: 324]: Loop Invariant [2018-09-26 21:53:49,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 272]: Loop Invariant [2018-09-26 21:53:49,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,387 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,388 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,388 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,388 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,388 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 377]: Loop Invariant [2018-09-26 21:53:49,389 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,390 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,390 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,390 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,390 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,392 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,393 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,394 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,394 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,394 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,394 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,395 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,395 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,395 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && ~nomsg + 1 == 0 && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && ~nomsg + 1 == 0 && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (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) - InvariantResult [Line: 355]: Loop Invariant [2018-09-26 21:53:49,396 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,396 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,396 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,396 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,397 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,397 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,397 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,397 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (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) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 333]: Loop Invariant [2018-09-26 21:53:49,398 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,399 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,399 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,399 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,399 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,399 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,400 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,400 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,400 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,400 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,400 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,401 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,402 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,403 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,404 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) && ~mode4 == 256 * (~mode4 / 256)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 289]: Loop Invariant [2018-09-26 21:53:49,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,406 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 312]: Loop Invariant [2018-09-26 21:53:49,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 279]: Loop Invariant [2018-09-26 21:53:49,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,411 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,411 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,411 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 401]: Loop Invariant [2018-09-26 21:53:49,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 368]: Loop Invariant [2018-09-26 21:53:49,415 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,415 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,417 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,417 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (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) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 302]: Loop Invariant [2018-09-26 21:53:49,417 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 416]: Loop Invariant [2018-09-26 21:53:49,420 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,420 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,420 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,420 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,422 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (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) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 346]: Loop Invariant [2018-09-26 21:53:49,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,428 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,428 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,428 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,430 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,430 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,430 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,430 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) && ~mode4 == 256 * (~mode4 / 256)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 406]: Loop Invariant [2018-09-26 21:53:49,431 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,431 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,431 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,431 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,432 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,432 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,432 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,432 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 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 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 431]: Loop Invariant [2018-09-26 21:53:49,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,434 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,434 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,434 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,434 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:53:49,435 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 23.0s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 273 SDslu, 241 SDs, 0 SdLazy, 194 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 437 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 281 NumberOfFragments, 2358 HoareAnnotationTreeSize, 16 FomulaSimplifications, 9830 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 32504 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 355 ConstructedInterpolants, 7 QuantifiedInterpolants, 130688 SizeOfPredicates, 4 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 410/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_overflow.ufo.UNBOUNDED.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-53-49-441.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-53-49-441.csv Received shutdown request...