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-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:25:31,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:31,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:31,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:31,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:31,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:31,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:31,630 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:31,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:31,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:31,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:31,634 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:31,635 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:31,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:31,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:31,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:31,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:31,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:31,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:31,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:31,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:31,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:31,658 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:31,658 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:31,659 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:31,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:31,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:31,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:31,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:31,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:31,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:31,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:31,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:31,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:31,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:31,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:31,672 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-09-26 21:25:31,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:31,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:31,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:31,701 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:31,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:31,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:31,702 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:31,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:31,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:31,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:31,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:31,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:31,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:31,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:31,704 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:31,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:31,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:31,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:31,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:31,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:31,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:31,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:31,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:31,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:31,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:31,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:31,708 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:31,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:31,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:31,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:31,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:31,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:31,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:31,800 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:31,801 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:31,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-09-26 21:25:31,802 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-09-26 21:25:31,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:31,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:31,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:31,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:31,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:31,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:31,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:31,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:31,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:31,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:31,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:32,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... [2018-09-26 21:25:32,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:32,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:32,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:32,055 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:32,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:32,813 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:32,813 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:32 BoogieIcfgContainer [2018-09-26 21:25:32,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:32,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:32,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:32,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:32,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:31" (1/2) ... [2018-09-26 21:25:32,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2615522b and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:25:32, skipping insertion in model container [2018-09-26 21:25:32,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:32" (2/2) ... [2018-09-26 21:25:32,822 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-09-26 21:25:32,832 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:32,843 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:32,894 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:32,895 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:32,895 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:32,895 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:32,896 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:32,896 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:32,896 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:32,896 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:32,896 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 21:25:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:32,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:32,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:32,924 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:32,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-26 21:25:32,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:32,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,268 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:33,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:33,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:33,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:33,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:33,293 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-26 21:25:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:33,365 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-26 21:25:33,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:33,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:33,380 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:25:33,380 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:25:33,385 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-09-26 21:25:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:25:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-26 21:25:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:25:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-26 21:25:33,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-26 21:25:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:33,434 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-26 21:25:33,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-26 21:25:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:33,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:33,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:33,436 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:33,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-26 21:25:33,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:33,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:33,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:33,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:33,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:33,598 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-26 21:25:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:33,642 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-26 21:25:33,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:33,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:33,644 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:25:33,645 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:25:33,646 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-09-26 21:25:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:25:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-26 21:25:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:25:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-26 21:25:33,671 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-26 21:25:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:33,672 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-26 21:25:33,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-26 21:25:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:33,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:33,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:33,675 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:33,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:33,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-26 21:25:33,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:33,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:33,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:33,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:33,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:33,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:33,768 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-09-26 21:25:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:33,834 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-09-26 21:25:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:33,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:33,839 INFO L225 Difference]: With dead ends: 199 [2018-09-26 21:25:33,839 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 21:25:33,840 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-09-26 21:25:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 21:25:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-09-26 21:25:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 21:25:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-09-26 21:25:33,889 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-09-26 21:25:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:33,890 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-09-26 21:25:33,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-09-26 21:25:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:33,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:33,892 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:33,893 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:33,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-09-26 21:25:33,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:33,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:33,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:33,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:34,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:34,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:34,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:34,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:34,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:34,042 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-09-26 21:25:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:34,314 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-09-26 21:25:34,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:34,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-26 21:25:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:34,322 INFO L225 Difference]: With dead ends: 277 [2018-09-26 21:25:34,322 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 21:25:34,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:25:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 21:25:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-09-26 21:25:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 21:25:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-09-26 21:25:34,396 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-09-26 21:25:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:34,397 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-09-26 21:25:34,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-09-26 21:25:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:34,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:34,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:34,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:34,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-09-26 21:25:34,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:34,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:34,523 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:34,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:34,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:34,526 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-09-26 21:25:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:34,630 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-09-26 21:25:34,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:34,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:34,633 INFO L225 Difference]: With dead ends: 359 [2018-09-26 21:25:34,633 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 21:25:34,634 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-09-26 21:25:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 21:25:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 21:25:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:25:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-26 21:25:34,677 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-09-26 21:25:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:34,677 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-26 21:25:34,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-26 21:25:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:34,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:34,679 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:34,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:34,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-09-26 21:25:34,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:34,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:34,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:34,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:34,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:34,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:34,819 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-26 21:25:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:34,953 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-26 21:25:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:34,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:34,958 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:25:34,959 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 21:25:34,960 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-09-26 21:25:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 21:25:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-26 21:25:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 21:25:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-26 21:25:35,037 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-26 21:25:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:35,038 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-26 21:25:35,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-26 21:25:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:35,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:35,042 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:35,042 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:35,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-09-26 21:25:35,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:35,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:35,144 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:35,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:35,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:35,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:35,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:35,146 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-26 21:25:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:35,389 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-26 21:25:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:35,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:35,396 INFO L225 Difference]: With dead ends: 1257 [2018-09-26 21:25:35,396 INFO L226 Difference]: Without dead ends: 839 [2018-09-26 21:25:35,398 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-09-26 21:25:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-26 21:25:35,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-26 21:25:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-26 21:25:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-26 21:25:35,534 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-26 21:25:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:35,534 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-26 21:25:35,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-26 21:25:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:35,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:35,547 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:35,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:35,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-09-26 21:25:35,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:35,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:35,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:35,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:35,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:35,725 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:35,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:35,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:35,727 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-26 21:25:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:36,048 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-26 21:25:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:36,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:36,058 INFO L225 Difference]: With dead ends: 2505 [2018-09-26 21:25:36,059 INFO L226 Difference]: Without dead ends: 1671 [2018-09-26 21:25:36,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-26 21:25:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-26 21:25:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-26 21:25:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-26 21:25:36,314 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-26 21:25:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:36,314 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-26 21:25:36,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-26 21:25:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:36,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:36,317 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:36,318 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:36,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:36,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-09-26 21:25:36,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:36,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:36,530 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:36,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:36,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:36,835 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-26 21:25:37,220 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-26 21:25:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:37,512 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:37,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-09-26 21:25:37,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:37,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:37,514 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-26 21:25:38,038 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-26 21:25:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:40,872 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-26 21:25:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:25:40,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-26 21:25:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:40,890 INFO L225 Difference]: With dead ends: 4801 [2018-09-26 21:25:40,890 INFO L226 Difference]: Without dead ends: 3135 [2018-09-26 21:25:40,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:25:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-26 21:25:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-26 21:25:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-26 21:25:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-26 21:25:41,311 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-26 21:25:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-26 21:25:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:25:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-26 21:25:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:25:41,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:41,315 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:25:41,316 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:41,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-09-26 21:25:41,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:41,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:41,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:25:41,497 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:41,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:41,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:41,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:41,499 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-26 21:25:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:42,116 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-26 21:25:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:42,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:25:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:42,127 INFO L225 Difference]: With dead ends: 4873 [2018-09-26 21:25:42,127 INFO L226 Difference]: Without dead ends: 2215 [2018-09-26 21:25:42,130 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-09-26 21:25:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-26 21:25:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-26 21:25:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-26 21:25:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-26 21:25:42,512 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-26 21:25:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:42,512 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-26 21:25:42,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-26 21:25:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:25:42,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:42,516 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 21:25:42,516 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:42,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-09-26 21:25:42,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:42,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:42,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:42,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-26 21:25:42,600 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:42,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:42,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:42,601 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-26 21:25:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:42,638 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-26 21:25:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:42,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:25:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:42,639 INFO L225 Difference]: With dead ends: 1799 [2018-09-26 21:25:42,639 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:25:42,642 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-09-26 21:25:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:25:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:25:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:25:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:25:42,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-26 21:25:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:42,643 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:25:42,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:25:42,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:25:42,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:25:42,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,856 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 46 [2018-09-26 21:25:42,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:42,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,143 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-09-26 21:25:43,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,378 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 46 [2018-09-26 21:25:43,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:43,910 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-09-26 21:25:44,671 WARN L178 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-26 21:25:45,984 WARN L178 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-26 21:25:46,493 WARN L178 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-26 21:25:46,802 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-26 21:25:47,209 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-26 21:25:47,484 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-26 21:25:47,927 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-26 21:25:47,931 INFO L422 ceAbstractionStarter]: At program point L415(lines 415 425) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (and .cse0 .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))) (<= ~mode3 1) (<= 1 ~mode3)) (and (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= ~p2_new .cse4) (<= 0 v_prenex_1)))) .cse2))) [2018-09-26 21:25:47,931 INFO L422 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-09-26 21:25:47,931 INFO L422 ceAbstractionStarter]: At program point L490(lines 484 491) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,931 INFO L422 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-26 21:25:47,932 INFO L422 ceAbstractionStarter]: At program point L387(lines 382 388) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-09-26 21:25:47,932 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-09-26 21:25:47,932 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-09-26 21:25:47,932 INFO L422 ceAbstractionStarter]: At program point L470(lines 464 471) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,932 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-09-26 21:25:47,933 INFO L422 ceAbstractionStarter]: At program point L392(lines 392 402) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-09-26 21:25:47,933 INFO L422 ceAbstractionStarter]: At program point L450(lines 444 451) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,933 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-09-26 21:25:47,933 INFO L422 ceAbstractionStarter]: At program point L541(lines 365 541) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-09-26 21:25:47,933 INFO L422 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-26 21:25:47,934 INFO L422 ceAbstractionStarter]: At program point L475(lines 475 485) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,934 INFO L422 ceAbstractionStarter]: At program point L372(lines 372 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))))) [2018-09-26 21:25:47,934 INFO L422 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-26 21:25:47,934 INFO L422 ceAbstractionStarter]: At program point L430(lines 424 431) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,935 INFO L422 ceAbstractionStarter]: At program point L455(lines 455 465) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,935 INFO L422 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (and .cse0 .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old))))) (<= ~mode3 1) (<= 1 ~mode3)) (and (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= ~p2_new .cse4) (<= 0 v_prenex_1)))) .cse2))) [2018-09-26 21:25:47,935 INFO L422 ceAbstractionStarter]: At program point L435(lines 435 445) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-09-26 21:25:47,942 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,943 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,943 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,943 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,949 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,949 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,950 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,950 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,966 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,966 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,988 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,988 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,988 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,993 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,993 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,993 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:47,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,044 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:25:48 BoogieIcfgContainer [2018-09-26 21:25:48,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:48,045 INFO L168 Benchmark]: Toolchain (without parser) took 16122.94 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 198.2 MB). Free memory was 1.4 GB in the beginning and 950.0 MB in the end (delta: 496.3 MB). Peak memory consumption was 694.5 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:48,047 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-09-26 21:25:48,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:48,048 INFO L168 Benchmark]: Boogie Preprocessor took 60.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:48,048 INFO L168 Benchmark]: RCFGBuilder took 759.08 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:48,049 INFO L168 Benchmark]: TraceAbstraction took 15229.68 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 198.2 MB). Free memory was 1.4 GB in the beginning and 950.0 MB in the end (delta: 454.0 MB). Peak memory consumption was 652.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:48,053 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 67.29 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 60.74 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 759.08 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15229.68 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 198.2 MB). Free memory was 1.4 GB in the beginning and 950.0 MB in the end (delta: 454.0 MB). Peak memory consumption was 652.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 424]: Loop Invariant [2018-09-26 21:25:48,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 382]: Loop Invariant [2018-09-26 21:25:48,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 444]: Loop Invariant [2018-09-26 21:25:48,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-26 21:25:48,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 484]: Loop Invariant [2018-09-26 21:25:48,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 415]: Loop Invariant [2018-09-26 21:25:48,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~send2 <= 127 && 0 <= ~send2) && ~nomsg + 1 == 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - InvariantResult [Line: 372]: Loop Invariant [2018-09-26 21:25:48,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 435]: Loop Invariant [2018-09-26 21:25:48,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 392]: Loop Invariant [2018-09-26 21:25:48,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 365]: Loop Invariant [2018-09-26 21:25:48,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 455]: Loop Invariant [2018-09-26 21:25:48,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 514]: Loop Invariant [2018-09-26 21:25:48,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~156 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 508]: Loop Invariant [2018-09-26 21:25:48,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 529]: Loop Invariant [2018-09-26 21:25:48,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((assert_~arg == 1 && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 475]: Loop Invariant [2018-09-26 21:25:48,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 401]: Loop Invariant [2018-09-26 21:25:48,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-26 21:25:48,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~send2 <= 127 && 0 <= ~send2) && ~nomsg + 1 == 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 15.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 966 HoareAnnotationTreeSize, 17 FomulaSimplifications, 82925 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 380 ConstructedInterpolants, 18 QuantifiedInterpolants, 54494 SizeOfPredicates, 4 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 254/272 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-25-48-127.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-25-48-127.csv Received shutdown request...