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.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:09:04,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:09:04,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:09:04,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:09:04,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:09:04,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:09:04,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:09:04,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:09:04,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:09:04,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:09:04,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:09:04,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:09:04,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:09:04,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:09:04,380 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:09:04,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:09:04,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:09:04,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:09:04,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:09:04,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:09:04,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:09:04,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:09:04,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:09:04,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:09:04,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:09:04,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:09:04,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:09:04,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:09:04,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:09:04,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:09:04,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:09:04,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:09:04,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:09:04,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:09:04,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:09:04,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:09:04,421 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-28 10:09:04,444 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:09:04,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:09:04,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:09:04,449 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:09:04,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:09:04,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:09:04,450 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:09:04,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:09:04,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:09:04,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:09:04,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:09:04,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:09:04,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:09:04,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:09:04,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:09:04,453 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:09:04,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:09:04,454 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:09:04,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:09:04,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:09:04,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:09:04,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:09:04,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:09:04,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:09:04,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:09:04,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:09:04,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:09:04,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:09:04,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:09:04,458 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:09:04,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:09:04,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:09:04,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:09:04,541 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:09:04,543 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:09:04,544 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.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-28 10:09:04,544 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-28 10:09:04,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:09:04,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:09:04,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:09:04,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:09:04,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:09:04,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:09:04,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:09:04,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:09:04,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:09:04,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/1) ... [2018-09-28 10:09:04,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:09:04,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:09:04,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:09:04,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:09:04,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (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-28 10:09:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:09:04,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:09:05,600 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:09:05,600 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:09:05 BoogieIcfgContainer [2018-09-28 10:09:05,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:09:05,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:09:05,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:09:05,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:09:05,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:04" (1/2) ... [2018-09-28 10:09:05,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@940e64f and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:09:05, skipping insertion in model container [2018-09-28 10:09:05,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:09:05" (2/2) ... [2018-09-28 10:09:05,608 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-28 10:09:05,618 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:09:05,626 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:09:05,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:09:05,676 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:09:05,676 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:09:05,676 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:09:05,676 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:09:05,676 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:09:05,677 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:09:05,677 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:09:05,677 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:09:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-28 10:09:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:05,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:05,700 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-28 10:09:05,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:05,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-28 10:09:05,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:05,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:05,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:06,009 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-28 10:09:06,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:06,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:06,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:06,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:06,032 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-28 10:09:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:06,095 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-28 10:09:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:06,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:09:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:06,107 INFO L225 Difference]: With dead ends: 57 [2018-09-28 10:09:06,108 INFO L226 Difference]: Without dead ends: 37 [2018-09-28 10:09:06,112 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-28 10:09:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-28 10:09:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-28 10:09:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-28 10:09:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-28 10:09:06,154 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-28 10:09:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:06,155 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-28 10:09:06,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-28 10:09:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:06,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:06,156 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-28 10:09:06,156 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:06,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-28 10:09:06,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:06,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:06,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:06,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:06,315 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-28 10:09:06,316 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:06,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:06,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:06,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:06,324 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-28 10:09:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:06,371 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-28 10:09:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:06,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:09:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:06,374 INFO L225 Difference]: With dead ends: 103 [2018-09-28 10:09:06,374 INFO L226 Difference]: Without dead ends: 69 [2018-09-28 10:09:06,375 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-28 10:09:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-28 10:09:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-28 10:09:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-28 10:09:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-28 10:09:06,395 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-28 10:09:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:06,396 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-28 10:09:06,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-28 10:09:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:06,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:06,397 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-28 10:09:06,398 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:06,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-28 10:09:06,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:06,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:06,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:06,583 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-28 10:09:06,583 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:06,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:09:06,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:09:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:09:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-28 10:09:06,585 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-28 10:09:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:06,751 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-28 10:09:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:09:06,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-28 10:09:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:06,756 INFO L225 Difference]: With dead ends: 141 [2018-09-28 10:09:06,756 INFO L226 Difference]: Without dead ends: 139 [2018-09-28 10:09:06,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-28 10:09:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-28 10:09:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-28 10:09:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-28 10:09:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-28 10:09:06,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-28 10:09:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:06,785 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-28 10:09:06,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:09:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-28 10:09:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:09:06,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:06,786 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-28 10:09:06,787 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:06,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-28 10:09:06,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:06,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:06,938 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-28 10:09:06,938 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:06,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:06,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:06,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:06,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:06,940 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-28 10:09:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:07,032 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-28 10:09:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:07,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:09:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:07,035 INFO L225 Difference]: With dead ends: 183 [2018-09-28 10:09:07,035 INFO L226 Difference]: Without dead ends: 109 [2018-09-28 10:09:07,036 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-28 10:09:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-28 10:09:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-28 10:09:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-28 10:09:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-28 10:09:07,063 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-28 10:09:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:07,063 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-28 10:09:07,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-28 10:09:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:07,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:07,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:07,066 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:07,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-28 10:09:07,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:07,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:07,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:07,201 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-28 10:09:07,201 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:07,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:07,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:07,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:07,203 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-28 10:09:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:07,285 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-28 10:09:07,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:07,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:07,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:07,288 INFO L225 Difference]: With dead ends: 321 [2018-09-28 10:09:07,288 INFO L226 Difference]: Without dead ends: 215 [2018-09-28 10:09:07,290 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-28 10:09:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-28 10:09:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-28 10:09:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-28 10:09:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-28 10:09:07,340 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-28 10:09:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:07,340 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-28 10:09:07,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-28 10:09:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:07,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:07,343 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-28 10:09:07,343 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:07,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-28 10:09:07,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:07,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:07,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:07,451 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-28 10:09:07,451 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:07,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:07,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:07,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:07,453 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-28 10:09:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:07,579 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-28 10:09:07,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:07,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:07,582 INFO L225 Difference]: With dead ends: 633 [2018-09-28 10:09:07,583 INFO L226 Difference]: Without dead ends: 423 [2018-09-28 10:09:07,584 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-28 10:09:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-28 10:09:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-28 10:09:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-28 10:09:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-28 10:09:07,668 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-28 10:09:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:07,669 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-28 10:09:07,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-28 10:09:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:07,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:07,675 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-28 10:09:07,676 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:07,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-28 10:09:07,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:07,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:07,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:07,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:07,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:07,834 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-28 10:09:07,835 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:07,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:07,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:07,836 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-28 10:09:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:08,019 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-28 10:09:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:08,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:08,027 INFO L225 Difference]: With dead ends: 1257 [2018-09-28 10:09:08,027 INFO L226 Difference]: Without dead ends: 839 [2018-09-28 10:09:08,030 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-28 10:09:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-28 10:09:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-28 10:09:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-28 10:09:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-28 10:09:08,164 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-28 10:09:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:08,165 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-28 10:09:08,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-28 10:09:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:08,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:08,168 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-28 10:09:08,169 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:08,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-28 10:09:08,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:08,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:08,316 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-28 10:09:08,316 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:08,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:08,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:08,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:08,318 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-28 10:09:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:08,661 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-28 10:09:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:08,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:09:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:08,671 INFO L225 Difference]: With dead ends: 2505 [2018-09-28 10:09:08,671 INFO L226 Difference]: Without dead ends: 1671 [2018-09-28 10:09:08,675 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-28 10:09:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-28 10:09:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-28 10:09:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-28 10:09:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-28 10:09:08,905 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-28 10:09:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:08,906 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-28 10:09:08,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-28 10:09:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:09:08,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:08,910 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-28 10:09:08,911 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:08,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-28 10:09:08,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:08,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:08,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:08,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:09,289 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-28 10:09:09,290 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:09:09,290 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-28 10:09:09,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:09,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:09:09,833 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-28 10:09:09,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:09:09,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-28 10:09:09,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:09:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:09:09,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 10:09:09,912 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-28 10:09:10,157 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-28 10:09:11,325 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-28 10:09:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:13,764 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-28 10:09:13,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:09:13,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-28 10:09:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:13,780 INFO L225 Difference]: With dead ends: 4801 [2018-09-28 10:09:13,780 INFO L226 Difference]: Without dead ends: 3135 [2018-09-28 10:09:13,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-28 10:09:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-28 10:09:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-28 10:09:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-28 10:09:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-28 10:09:14,171 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-28 10:09:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:14,171 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-28 10:09:14,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:09:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-28 10:09:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:09:14,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:14,178 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-28 10:09:14,178 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:14,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:14,179 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-28 10:09:14,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:14,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:14,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:14,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:14,374 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-28 10:09:14,374 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:14,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:14,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:14,375 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-28 10:09:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:15,114 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-28 10:09:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:15,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-28 10:09:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:15,125 INFO L225 Difference]: With dead ends: 4873 [2018-09-28 10:09:15,125 INFO L226 Difference]: Without dead ends: 2215 [2018-09-28 10:09:15,129 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-28 10:09:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-28 10:09:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-28 10:09:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-28 10:09:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-28 10:09:15,451 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-28 10:09:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:15,452 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-28 10:09:15,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-28 10:09:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:09:15,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:15,455 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-28 10:09:15,455 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:15,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-28 10:09:15,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:15,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:15,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:15,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:09:15,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:15,535 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-28 10:09:15,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:15,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:15,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:15,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:15,537 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-28 10:09:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:15,574 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-28 10:09:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:15,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-28 10:09:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:15,575 INFO L225 Difference]: With dead ends: 1799 [2018-09-28 10:09:15,575 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:09:15,579 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-28 10:09:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:09:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:09:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:09:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:09:15,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-28 10:09:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:15,580 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:09:15,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:09:15,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:09:15,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:09:15,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,752 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-28 10:09:15,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:15,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:16,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:17,458 WARN L178 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-28 10:09:17,700 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:17,901 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:18,083 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:18,449 WARN L178 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-28 10:09:18,609 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:18,745 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-28 10:09:18,951 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:19,136 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:19,337 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:19,513 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-28 10:09:19,616 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-28 10:09:19,738 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:09:19,742 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-28 10:09:19,743 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-28 10:09:19,743 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,743 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-28 10:09:19,743 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-28 10:09:19,743 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:09:19,744 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:09:19,744 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-28 10:09:19,744 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-28 10:09:19,744 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,744 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-28 10:09:19,744 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-28 10:09:19,745 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:09:19,745 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,745 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-28 10:09:19,745 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,745 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-28 10:09:19,745 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,746 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-28 10:09:19,746 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,746 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:09:19,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,765 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,767 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,767 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,772 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,774 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,774 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,776 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,776 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,780 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,780 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,782 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,782 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,784 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,784 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,787 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,787 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,789 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,789 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,791 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,791 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,793 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,793 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,799 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,799 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,803 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,803 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,807 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:09:19 BoogieIcfgContainer [2018-09-28 10:09:19,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:09:19,808 INFO L168 Benchmark]: Toolchain (without parser) took 15161.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 172.5 MB). Free memory was 1.5 GB in the beginning and 944.6 MB in the end (delta: 522.1 MB). Peak memory consumption was 694.6 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:19,810 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:09:19,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:09:19,811 INFO L168 Benchmark]: Boogie Preprocessor took 57.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:09:19,812 INFO L168 Benchmark]: RCFGBuilder took 845.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:19,812 INFO L168 Benchmark]: TraceAbstraction took 14206.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 172.5 MB). Free memory was 1.4 GB in the beginning and 944.6 MB in the end (delta: 479.8 MB). Peak memory consumption was 652.3 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:19,817 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 845.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14206.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 172.5 MB). Free memory was 1.4 GB in the beginning and 944.6 MB in the end (delta: 479.8 MB). Peak memory consumption was 652.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-09-28 10:09:19,828 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,830 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,830 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-28 10:09:19,831 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,831 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,832 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,833 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-28 10:09:19,834 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,834 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,835 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,835 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-28 10:09:19,836 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,836 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,837 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,837 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-28 10:09:19,838 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,839 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,839 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-28 10:09:19,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-28 10:09:19,844 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,844 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,845 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,845 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-28 10:09:19,846 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,846 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,847 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,847 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-28 10:09:19,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-28 10:09:19,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,852 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:09:19,852 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-09-19-858.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-09-19-858.csv Received shutdown request...