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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:27:33,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:33,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:33,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:33,338 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:33,339 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:33,340 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:33,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:33,344 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:33,345 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:33,346 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:33,346 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:33,347 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:33,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:33,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:33,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:33,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:33,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:33,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:33,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:33,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:33,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:33,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:33,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:33,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:33,364 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:33,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:33,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:33,366 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:33,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:33,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:33,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:33,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:33,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:33,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:33,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:33,371 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:27:33,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:33,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:33,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:33,389 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:33,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:33,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:33,390 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:33,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:33,390 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:33,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:33,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:33,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:33,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:33,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:33,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:33,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:33,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:33,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:33,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:33,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:33,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:33,393 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:33,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:33,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:33,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:33,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:33,394 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:33,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:33,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:33,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:33,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:33,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:33,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:33,469 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:33,470 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:33,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 12:27:33,471 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-10-04 12:27:33,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:33,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:33,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:33,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:33,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:33,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:33,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:33,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:33,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:33,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... [2018-10-04 12:27:33,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:33,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:33,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:33,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:33,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:34,369 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:34,370 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:34 BoogieIcfgContainer [2018-10-04 12:27:34,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:34,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:34,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:34,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:34,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:33" (1/2) ... [2018-10-04 12:27:34,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e81c77 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:27:34, skipping insertion in model container [2018-10-04 12:27:34,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:34" (2/2) ... [2018-10-04 12:27:34,379 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 12:27:34,388 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:34,399 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:34,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:34,450 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:34,450 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:34,450 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:34,451 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:34,451 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:34,451 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:34,451 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:34,451 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 12:27:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:27:34,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:34,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:34,477 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:34,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-04 12:27:34,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:34,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:34,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:34,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:34,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:34,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:34,740 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 12:27:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:34,811 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-04 12:27:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:34,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:27:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:34,825 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:27:34,826 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:27:34,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:27:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 12:27:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:27:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-04 12:27:34,877 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-04 12:27:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:34,877 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-04 12:27:34,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-04 12:27:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:27:34,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:34,878 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:34,879 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:34,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-04 12:27:34,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:34,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:34,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:35,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:35,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:35,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:35,050 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-04 12:27:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:35,093 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-04 12:27:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:35,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:27:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:35,097 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:27:35,098 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:27:35,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:27:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-04 12:27:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:27:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-04 12:27:35,117 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-04 12:27:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:35,118 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-04 12:27:35,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 12:27:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:27:35,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:35,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:35,119 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:35,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-04 12:27:35,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:35,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:35,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:35,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:35,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:35,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:35,267 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-04 12:27:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:35,348 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-04 12:27:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:35,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:27:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:35,355 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:27:35,356 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:27:35,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:27:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-04 12:27:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:27:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-04 12:27:35,383 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-04 12:27:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:35,384 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-04 12:27:35,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-04 12:27:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:27:35,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:35,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:35,386 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:35,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-04 12:27:35,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:35,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:35,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:35,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:35,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:35,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:35,507 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-04 12:27:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:35,615 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-04 12:27:35,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:35,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:27:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:35,626 INFO L225 Difference]: With dead ends: 269 [2018-10-04 12:27:35,626 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 12:27:35,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 12:27:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-04 12:27:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:27:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-04 12:27:35,682 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-04 12:27:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:35,682 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-04 12:27:35,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-04 12:27:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:27:35,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:35,686 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:35,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:35,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-04 12:27:35,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:35,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:35,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:35,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:35,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:35,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:35,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:35,809 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-04 12:27:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:36,025 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-04 12:27:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:36,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 12:27:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:36,033 INFO L225 Difference]: With dead ends: 293 [2018-10-04 12:27:36,033 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 12:27:36,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:27:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 12:27:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-04 12:27:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:27:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-04 12:27:36,108 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-04 12:27:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:36,109 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-04 12:27:36,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-04 12:27:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:27:36,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:36,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:36,114 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:36,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-04 12:27:36,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:36,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:36,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:36,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:36,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:36,314 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-04 12:27:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:36,432 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-04 12:27:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:36,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 12:27:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:36,435 INFO L225 Difference]: With dead ends: 525 [2018-10-04 12:27:36,436 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 12:27:36,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 12:27:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-04 12:27:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 12:27:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-04 12:27:36,501 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-04 12:27:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:36,501 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-04 12:27:36,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-04 12:27:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:27:36,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:36,504 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:36,505 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:36,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-04 12:27:36,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:36,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:36,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:36,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:36,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:36,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:37,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:37,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:27:37,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:37,202 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 4 states. [2018-10-04 12:27:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:37,532 INFO L93 Difference]: Finished difference Result 799 states and 1041 transitions. [2018-10-04 12:27:37,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:27:37,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-04 12:27:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:37,538 INFO L225 Difference]: With dead ends: 799 [2018-10-04 12:27:37,539 INFO L226 Difference]: Without dead ends: 557 [2018-10-04 12:27:37,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-04 12:27:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-10-04 12:27:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-04 12:27:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-10-04 12:27:37,644 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-10-04 12:27:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:37,645 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-10-04 12:27:37,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-10-04 12:27:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:27:37,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:37,654 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:37,654 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:37,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-10-04 12:27:37,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:37,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:38,207 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 12:27:38,440 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 12:27:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-04 12:27:38,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:38,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:38,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:27:38,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:27:38,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:27:38,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:39,077 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-04 12:27:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-04 12:27:39,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:39,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:27:39,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:27:39,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:27:39,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:27:39,401 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-10-04 12:27:39,780 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-04 12:27:40,624 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-10-04 12:27:41,233 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-10-04 12:27:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:41,462 INFO L93 Difference]: Finished difference Result 623 states and 764 transitions. [2018-10-04 12:27:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:27:41,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-04 12:27:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:41,464 INFO L225 Difference]: With dead ends: 623 [2018-10-04 12:27:41,464 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:41,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:27:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:41,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-04 12:27:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:41,467 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:41,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:27:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:41,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:41,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:41,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:41,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:41,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:41,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:41,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:41,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:41,855 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-04 12:27:42,127 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-04 12:27:42,413 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-04 12:27:42,618 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-04 12:27:42,737 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-04 12:27:42,883 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-04 12:27:43,101 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-04 12:27:43,274 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-04 12:27:43,538 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:27:43,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-10-04 12:27:43,538 INFO L421 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse7 (<= ~send1 127)) (.cse8 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 .cse3 (<= 1 ULTIMATE.start_check_~tmp~83) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 (not (= ~p1_old ~nomsg)) .cse5 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse6 (mod v_prenex_2 256))) (and (<= .cse6 127) (= ~p4_old .cse6) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse7 .cse8 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse5 .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_2 Int)) (let ((.cse9 (mod v_prenex_2 256))) (and (<= .cse9 127) (<= v_prenex_2 127) (<= 0 v_prenex_2) (= ~p4_new .cse9)))) .cse4))) [2018-10-04 12:27:43,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-10-04 12:27:43,538 INFO L421 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_assert_~arg 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~r1)) (.cse10 (<= ~r1 0)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse12 (<= ~send1 127)) (.cse13 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (= ~mode4 (* 256 (div ~mode4 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse4 .cse12 .cse13 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (exists ((v_prenex_2 Int)) (let ((.cse15 (mod v_prenex_2 256))) (and (<= .cse15 127) (= ~p4_old .cse15) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse12 .cse13 .cse14) (and .cse9 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse11 .cse3 (<= ~r1 1) .cse12 .cse13 .cse5 .cse7))) [2018-10-04 12:27:43,539 INFO L421 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-10-04 12:27:43,539 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-10-04 12:27:43,539 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-10-04 12:27:43,539 INFO L421 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_assert_~arg 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~r1)) (.cse10 (<= ~r1 0)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse12 (<= ~send1 127)) (.cse13 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (= ~mode4 (* 256 (div ~mode4 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse4 .cse12 .cse13 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (exists ((v_prenex_2 Int)) (let ((.cse15 (mod v_prenex_2 256))) (and (<= .cse15 127) (= ~p4_old .cse15) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse12 .cse13 .cse14) (and .cse9 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse11 .cse3 (<= ~r1 1) .cse12 .cse13 .cse5 .cse7))) [2018-10-04 12:27:43,539 INFO L421 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse2 (<= 0 ~send1)) (.cse3 (<= 0 ~send4)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse9 (<= 0 ~r1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~r1 0)) (.cse5 (<= ~send1 127)) (.cse6 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_2 Int)) (let ((.cse4 (mod v_prenex_2 256))) (and (<= .cse4 127) (= ~p4_old .cse4) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ULTIMATE.start_assert_~arg 1) .cse2 .cse3 (<= ~mode2 1) .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse0 .cse1 (<= 1 ~mode2) .cse5 .cse6 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:27:43,539 INFO L421 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:27:43,540 INFO L421 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse4 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse4 .cse5 .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse2 .cse3))) [2018-10-04 12:27:43,540 INFO L421 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:27:43,540 INFO L421 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse9 (<= 1 ULTIMATE.start_assert_~arg)) (.cse2 (<= ~r1 0)) (.cse3 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse12 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse11 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 256))) (and (<= .cse5 127) (= ~p4_old .cse5) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (<= ~mode2 1) .cse8 .cse10 .cse12 .cse11 .cse0 .cse2 (<= 1 ~mode2) .cse6 .cse7 .cse9) (and .cse2 .cse3 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse4 .cse6 .cse7 .cse8 .cse12 .cse11))) [2018-10-04 12:27:43,540 INFO L421 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse4 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse4 .cse5 .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse2 .cse3))) [2018-10-04 12:27:43,540 INFO L421 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse9 (<= 1 ULTIMATE.start_assert_~arg)) (.cse2 (<= ~r1 0)) (.cse3 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse12 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse11 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 256))) (and (<= .cse5 127) (= ~p4_old .cse5) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (<= ~mode2 1) .cse8 .cse10 .cse12 .cse11 .cse0 .cse2 (<= 1 ~mode2) .cse6 .cse7 .cse9) (and .cse2 .cse3 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse4 .cse6 .cse7 .cse8 .cse12 .cse11))) [2018-10-04 12:27:43,541 INFO L421 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse3 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse11 (<= 0 ~r1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse2 (<= ~r1 0)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse9 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 256))) (and (<= .cse5 127) (= ~p4_old .cse5) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse4 (<= ~mode2 1) .cse8 .cse10 (= ~mode4 (* 256 (div ~mode4 256))) .cse11 .cse0 .cse2 (<= 1 ~mode2) .cse6 .cse7 .cse9))) [2018-10-04 12:27:43,541 INFO L421 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~mode4 (* 256 (div ~mode4 256))) .cse7) (and (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 .cse6 (<= 1 ULTIMATE.start_check_~tmp~83) .cse7 (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:27:43,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,577 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,578 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,580 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,588 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,588 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,588 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,589 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,591 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,595 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,595 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,595 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,597 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,597 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,599 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,599 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,603 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,603 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,604 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,608 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,613 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,613 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,613 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,615 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,618 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,624 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,629 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,631 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,633 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,636 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,636 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,636 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,651 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,651 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,656 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,658 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:27:43 BoogieIcfgContainer [2018-10-04 12:27:43,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:43,659 INFO L168 Benchmark]: Toolchain (without parser) took 10086.60 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 53.1 MB). Peak memory consumption was 490.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:43,661 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:43,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:43,663 INFO L168 Benchmark]: Boogie Preprocessor took 51.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:43,663 INFO L168 Benchmark]: RCFGBuilder took 692.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:43,665 INFO L168 Benchmark]: TraceAbstraction took 9286.93 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.4 MB). Peak memory consumption was 459.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:43,670 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.78 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 51.12 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 692.96 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 9286.93 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.4 MB). Peak memory consumption was 459.0 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant [2018-10-04 12:27:43,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,700 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1)) || ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 265]: Loop Invariant [2018-10-04 12:27:43,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,703 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 287]: Loop Invariant [2018-10-04 12:27:43,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,708 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,708 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,708 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 331]: Loop Invariant [2018-10-04 12:27:43,709 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,709 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,709 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,709 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 226]: Loop Invariant [2018-10-04 12:27:43,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,712 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,712 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,712 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,713 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) - InvariantResult [Line: 233]: Loop Invariant [2018-10-04 12:27:43,714 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) - InvariantResult [Line: 346]: Loop Invariant [2018-10-04 12:27:43,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,725 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 336]: Loop Invariant [2018-10-04 12:27:43,726 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,726 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 361]: Loop Invariant [2018-10-04 12:27:43,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 0 <= ~send1) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 256]: Loop Invariant [2018-10-04 12:27:43,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1)) || ((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 278]: Loop Invariant [2018-10-04 12:27:43,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 310]: Loop Invariant [2018-10-04 12:27:43,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && v_prenex_2 <= 127) && 0 <= v_prenex_2) && ~p4_new == v_prenex_2 % 256)) && 0 <= ~r1) - InvariantResult [Line: 300]: Loop Invariant [2018-10-04 12:27:43,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:43,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || ((((((((((((((assert_~arg <= 1 && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 167 SDslu, 174 SDs, 0 SdLazy, 120 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 82 NumberOfFragments, 1636 HoareAnnotationTreeSize, 14 FomulaSimplifications, 2787 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 257 ConstructedInterpolants, 7 QuantifiedInterpolants, 35099 SizeOfPredicates, 5 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 173/195 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.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-27-43-749.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-27-43-749.csv Received shutdown request...