java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:36:16,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:36:16,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:36:16,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:36:16,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:36:16,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:36:16,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:36:16,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:36:16,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:36:16,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:36:16,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:36:16,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:36:16,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:36:16,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:36:16,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:36:16,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:36:16,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:36:16,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:36:16,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:36:16,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:36:16,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:36:16,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:36:16,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:36:16,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:36:16,275 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:36:16,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:36:16,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:36:16,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:36:16,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:36:16,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:36:16,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:36:16,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:36:16,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:36:16,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:36:16,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:36:16,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:36:16,294 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-28 10:36:16,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:36:16,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:36:16,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:36:16,321 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:36:16,326 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:36:16,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:36:16,326 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:36:16,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:36:16,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:36:16,328 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:36:16,328 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:36:16,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:36:16,328 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:36:16,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:36:16,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:36:16,329 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:36:16,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:36:16,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:36:16,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:36:16,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:36:16,330 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:36:16,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:36:16,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:36:16,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:36:16,331 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:36:16,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:36:16,333 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:36:16,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:36:16,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:36:16,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:36:16,334 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-28 10:36:16,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:36:16,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:36:16,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:36:16,409 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:36:16,410 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:36:16,410 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:36:16,411 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:36:16,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:36:16,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:36:16,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:36:16,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:36:16,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:36:16,525 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:36:16" (1/1) ... [2018-09-28 10:36:16,544 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:36:16" (1/1) ... [2018-09-28 10:36:16,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:36:16,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:36:16,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:36:16,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:36:16,569 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:36:16" (1/1) ... [2018-09-28 10:36:16,569 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:36:16" (1/1) ... [2018-09-28 10:36:16,574 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:36:16" (1/1) ... [2018-09-28 10:36:16,583 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:36:16" (1/1) ... [2018-09-28 10:36:16,604 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:36:16" (1/1) ... [2018-09-28 10:36:16,607 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:36:16" (1/1) ... [2018-09-28 10:36:16,610 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:36:16" (1/1) ... [2018-09-28 10:36:16,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:36:16,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:36:16,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:36:16,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:36:16,617 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:36:16" (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:36:16,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:36:16,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:36:17,481 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:36:17,481 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:36:17 BoogieIcfgContainer [2018-09-28 10:36:17,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:36:17,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:36:17,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:36:17,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:36:17,486 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:36:16" (1/2) ... [2018-09-28 10:36:17,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da801d1 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:36:17, skipping insertion in model container [2018-09-28 10:36:17,488 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:36:17" (2/2) ... [2018-09-28 10:36:17,489 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-28 10:36:17,499 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:36:17,508 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:36:17,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:36:17,558 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:36:17,559 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:36:17,559 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:36:17,559 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:36:17,559 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:36:17,559 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:36:17,560 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:36:17,560 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:36:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-28 10:36:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:36:17,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:17,584 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:36:17,585 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:17,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-28 10:36:17,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:17,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:17,955 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:36:17,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:17,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:36:17,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:17,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:17,983 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-28 10:36:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:18,109 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-28 10:36:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:18,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:36:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:18,122 INFO L225 Difference]: With dead ends: 57 [2018-09-28 10:36:18,122 INFO L226 Difference]: Without dead ends: 37 [2018-09-28 10:36:18,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-28 10:36:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-28 10:36:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-28 10:36:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-28 10:36:18,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-28 10:36:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:18,172 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-28 10:36:18,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-28 10:36:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:36:18,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:18,173 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:36:18,173 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:18,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-28 10:36:18,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:18,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:18,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:18,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:18,302 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:36:18,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:18,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:36:18,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:18,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:18,306 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-28 10:36:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:18,425 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-28 10:36:18,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:18,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:36:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:18,428 INFO L225 Difference]: With dead ends: 103 [2018-09-28 10:36:18,430 INFO L226 Difference]: Without dead ends: 69 [2018-09-28 10:36:18,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-28 10:36:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-28 10:36:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-28 10:36:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-28 10:36:18,467 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-28 10:36:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:18,473 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-28 10:36:18,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-28 10:36:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:36:18,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:18,475 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:36:18,476 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:18,477 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-28 10:36:18,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:18,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:18,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:18,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:18,675 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:36:18,675 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:18,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:36:18,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:36:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:36:18,680 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:18,680 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-28 10:36:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:19,032 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-28 10:36:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:36:19,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-28 10:36:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:19,038 INFO L225 Difference]: With dead ends: 141 [2018-09-28 10:36:19,038 INFO L226 Difference]: Without dead ends: 139 [2018-09-28 10:36:19,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-28 10:36:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-28 10:36:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-28 10:36:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-28 10:36:19,065 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-28 10:36:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:19,066 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-28 10:36:19,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:36:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-28 10:36:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:36:19,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:19,067 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:36:19,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:19,067 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-28 10:36:19,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:19,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:19,203 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:36:19,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:19,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:36:19,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:19,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:19,205 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-28 10:36:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:19,363 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-28 10:36:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:19,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-28 10:36:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:19,365 INFO L225 Difference]: With dead ends: 183 [2018-09-28 10:36:19,366 INFO L226 Difference]: Without dead ends: 109 [2018-09-28 10:36:19,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-28 10:36:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-28 10:36:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-28 10:36:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-28 10:36:19,393 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-28 10:36:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:19,393 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-28 10:36:19,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-28 10:36:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:36:19,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:19,395 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:36:19,395 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:19,396 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-28 10:36:19,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:19,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:19,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:19,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:19,516 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:36:19,516 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:19,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:36:19,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:19,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:19,518 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-28 10:36:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:19,613 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-28 10:36:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:19,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:36:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:19,618 INFO L225 Difference]: With dead ends: 321 [2018-09-28 10:36:19,618 INFO L226 Difference]: Without dead ends: 215 [2018-09-28 10:36:19,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-28 10:36:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-28 10:36:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-28 10:36:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-28 10:36:19,666 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-28 10:36:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:19,666 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-28 10:36:19,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-28 10:36:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:36:19,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:19,669 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:36:19,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:19,669 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-28 10:36:19,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:19,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:19,825 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:36:19,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:19,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:36:19,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:19,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:19,828 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-28 10:36:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:20,166 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-28 10:36:20,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:20,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:36:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:20,171 INFO L225 Difference]: With dead ends: 633 [2018-09-28 10:36:20,171 INFO L226 Difference]: Without dead ends: 423 [2018-09-28 10:36:20,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-28 10:36:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-28 10:36:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-28 10:36:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-28 10:36:20,265 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-28 10:36:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:20,265 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-28 10:36:20,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-28 10:36:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:36:20,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:20,274 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:36:20,275 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:20,275 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-28 10:36:20,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:20,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:20,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:20,408 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:36:20,408 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:20,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:36:20,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:20,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:20,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:20,409 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-28 10:36:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:20,761 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-28 10:36:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:20,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:36:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:20,767 INFO L225 Difference]: With dead ends: 1257 [2018-09-28 10:36:20,767 INFO L226 Difference]: Without dead ends: 839 [2018-09-28 10:36:20,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-28 10:36:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-28 10:36:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-28 10:36:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-28 10:36:20,889 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-28 10:36:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:20,889 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-28 10:36:20,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-28 10:36:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:36:20,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:20,892 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:36:20,893 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:20,893 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-28 10:36:20,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:21,002 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:36:21,002 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:21,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:36:21,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:21,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:21,004 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-28 10:36:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:21,521 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-28 10:36:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:21,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-28 10:36:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:21,531 INFO L225 Difference]: With dead ends: 2505 [2018-09-28 10:36:21,531 INFO L226 Difference]: Without dead ends: 1671 [2018-09-28 10:36:21,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-28 10:36:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-28 10:36:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-28 10:36:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-28 10:36:21,762 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-28 10:36:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:21,762 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-28 10:36:21,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-28 10:36:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-28 10:36:21,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:21,766 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:36:21,766 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:21,769 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-28 10:36:21,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:22,076 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:36:22,078 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:36:22,079 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:36:22,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:22,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:36:23,405 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:36:23,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:36:23,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-28 10:36:23,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:36:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:36:23,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:23,441 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-28 10:36:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:29,078 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-28 10:36:29,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:36:29,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-28 10:36:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:29,093 INFO L225 Difference]: With dead ends: 4801 [2018-09-28 10:36:29,094 INFO L226 Difference]: Without dead ends: 3135 [2018-09-28 10:36:29,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-28 10:36:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-28 10:36:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-28 10:36:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-28 10:36:29,462 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-28 10:36:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:29,462 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-28 10:36:29,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:36:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-28 10:36:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:36:29,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:29,466 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:36:29,467 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:29,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:29,467 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-28 10:36:29,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:29,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:29,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:36:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:29,633 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:36:29,634 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:29,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:36:29,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:29,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:29,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:29,635 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-28 10:36:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:30,327 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-28 10:36:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:30,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-28 10:36:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:30,336 INFO L225 Difference]: With dead ends: 4873 [2018-09-28 10:36:30,336 INFO L226 Difference]: Without dead ends: 2215 [2018-09-28 10:36:30,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-28 10:36:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-28 10:36:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-28 10:36:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-28 10:36:30,659 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-28 10:36:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:30,659 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-28 10:36:30,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-28 10:36:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-28 10:36:30,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:36:30,662 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:36:30,663 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:36:30,663 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:36:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-28 10:36:30,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:36:30,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:36:30,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:30,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:36:30,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:36:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:36:30,763 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:36:30,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:36:30,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:36:30,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:36:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:36:30,764 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:36:30,764 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-28 10:36:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:36:30,805 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-28 10:36:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:36:30,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-28 10:36:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:36:30,806 INFO L225 Difference]: With dead ends: 1799 [2018-09-28 10:36:30,806 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:36:30,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:36:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:36:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:36:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:36:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:36:30,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-28 10:36:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:36:30,810 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:36:30,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:36:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:36:30,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:36:30,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:36:30,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:30,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,010 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-28 10:36:31,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,287 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-28 10:36:31,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,870 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-28 10:36:31,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:31,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:32,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:32,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:36:33,091 WARN L178 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-28 10:36:33,321 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:33,440 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:34,117 WARN L178 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:34,298 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-28 10:36:34,417 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:34,544 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-28 10:36:34,758 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:34,952 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:35,127 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:35,496 WARN L178 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-28 10:36:35,702 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:35,706 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:36:35,706 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:36:35,706 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:36:35,706 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:36:35,706 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:36:35,706 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:36:35,706 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-28 10:36:35,707 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:36:35,707 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:36:35,707 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:36:35,707 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:36:35,707 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-28 10:36:35,707 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:36:35,708 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:36:35,708 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:36:35,708 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:36:35,708 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:36:35,709 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-28 10:36:35,709 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:36:35,709 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:36:35,709 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:36:35,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,728 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,728 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,730 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,730 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,732 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,732 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,733 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,733 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,735 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,735 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,737 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,737 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,739 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,739 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,740 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,740 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,743 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,744 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,747 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,747 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,748 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,748 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,750 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,751 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,752 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,752 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,754 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,754 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,757 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,761 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:36:35 BoogieIcfgContainer [2018-09-28 10:36:35,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:36:35,762 INFO L168 Benchmark]: Toolchain (without parser) took 19260.63 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 269.5 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -240.9 MB). Peak memory consumption was 711.3 MB. Max. memory is 7.1 GB. [2018-09-28 10:36:35,764 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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:36:35,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.96 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:36:35,765 INFO L168 Benchmark]: Boogie Preprocessor took 62.49 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:36:35,766 INFO L168 Benchmark]: RCFGBuilder took 865.90 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-28 10:36:35,766 INFO L168 Benchmark]: TraceAbstraction took 18278.64 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 269.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -293.8 MB). Peak memory consumption was 658.4 MB. Max. memory is 7.1 GB. [2018-09-28 10:36:35,771 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.26 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 46.96 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 62.49 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 865.90 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18278.64 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 269.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -293.8 MB). Peak memory consumption was 658.4 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:36:35,783 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,783 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,785 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:36:35,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,787 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,788 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:36:35,789 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,789 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,790 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,790 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:36:35,791 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,791 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,792 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,792 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:36:35,793 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,793 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,794 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,794 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:36:35,796 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,796 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,797 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:36:35,798 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,798 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,799 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,799 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:36:35,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,802 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:36:35,803 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,803 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,804 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,804 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:36:35,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,806 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:35,806 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, 18.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-36-35-812.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_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-36-35-812.csv Received shutdown request...