java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:25:36,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:36,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:36,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:36,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:36,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:36,407 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:36,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:36,411 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:36,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:36,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:36,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:36,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:36,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:36,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:36,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:36,418 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:36,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:36,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:36,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:36,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:36,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:36,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:36,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:36,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:36,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:36,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:36,431 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:36,432 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:36,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:36,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:36,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:36,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:36,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:36,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:36,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:36,436 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:25:36,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:36,452 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:36,453 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:36,453 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:36,453 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:36,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:36,454 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:36,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:36,454 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:36,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:36,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:36,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:36,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:36,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:36,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:36,456 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:36,456 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:36,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:36,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:36,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:36,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:36,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:36,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:36,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:36,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:36,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:36,458 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:36,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:36,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:36,458 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:36,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:36,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:36,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:36,519 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:36,520 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:36,521 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-26 21:25:36,521 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-26 21:25:36,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:36,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:36,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:36,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:36,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:36,627 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,648 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:36,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:36,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:36,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:36,669 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,669 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,681 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,681 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,704 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,710 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,716 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 26.09 09:25:36" (1/1) ... [2018-09-26 21:25:36,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:36,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:36,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:36,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:36,727 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 26.09 09:25:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:36,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:37,457 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:37,457 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 26.09 09:25:37 BoogieIcfgContainer [2018-09-26 21:25:37,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:37,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:37,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:37,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:37,463 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 26.09 09:25:36" (1/2) ... [2018-09-26 21:25:37,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c5fef4 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:25:37, skipping insertion in model container [2018-09-26 21:25:37,464 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 26.09 09:25:37" (2/2) ... [2018-09-26 21:25:37,467 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-26 21:25:37,478 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:37,488 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:37,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:37,538 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:37,538 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:37,538 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:37,539 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:37,539 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:37,539 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:37,539 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:37,539 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 21:25:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:37,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:37,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:37,565 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:37,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-26 21:25:37,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:37,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:37,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:37,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:37,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:37,911 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:37,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:37,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:37,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:37,935 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-26 21:25:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:38,004 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-26 21:25:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:38,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:38,018 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:25:38,018 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:25:38,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:25:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-26 21:25:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:25:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-26 21:25:38,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-26 21:25:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:38,070 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-26 21:25:38,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-26 21:25:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:38,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:38,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:38,072 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:38,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-26 21:25:38,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:38,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:38,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:38,224 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:38,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:38,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:38,228 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-26 21:25:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:38,267 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-26 21:25:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:38,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:38,270 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:25:38,270 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:25:38,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:25:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-26 21:25:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:25:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-26 21:25:38,293 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-26 21:25:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:38,294 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-26 21:25:38,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-26 21:25:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:38,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:38,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:38,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:38,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-26 21:25:38,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:38,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:38,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:38,474 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:38,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:38,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:38,476 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-26 21:25:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:38,641 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-26 21:25:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:38,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-26 21:25:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:38,647 INFO L225 Difference]: With dead ends: 141 [2018-09-26 21:25:38,647 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 21:25:38,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:25:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 21:25:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-26 21:25:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 21:25:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-26 21:25:38,676 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-26 21:25:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:38,676 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-26 21:25:38,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-26 21:25:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:25:38,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:38,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:38,681 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:38,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-26 21:25:38,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:38,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:38,832 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:38,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:38,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:38,834 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-26 21:25:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:38,948 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-26 21:25:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:38,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:25:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:38,951 INFO L225 Difference]: With dead ends: 183 [2018-09-26 21:25:38,952 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:25:38,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:25:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 21:25:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:25:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-26 21:25:38,978 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-26 21:25:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:38,979 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-26 21:25:38,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-26 21:25:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:38,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:38,981 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-26 21:25:38,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:38,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-26 21:25:38,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:38,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:38,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:38,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:38,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:39,124 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:39,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:39,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:39,126 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-26 21:25:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:39,204 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-26 21:25:39,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:39,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:39,209 INFO L225 Difference]: With dead ends: 321 [2018-09-26 21:25:39,209 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 21:25:39,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 21:25:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-26 21:25:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:25:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-26 21:25:39,280 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-26 21:25:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:39,280 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-26 21:25:39,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-26 21:25:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:39,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:39,283 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:39,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:39,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-26 21:25:39,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:39,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:39,454 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:39,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:39,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:39,456 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-26 21:25:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:39,612 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-26 21:25:39,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:39,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:39,630 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:25:39,630 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 21:25:39,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 21:25:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-26 21:25:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 21:25:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-26 21:25:39,736 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-26 21:25:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-26 21:25:39,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-26 21:25:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:39,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:39,740 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:39,740 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:39,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-26 21:25:39,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:39,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:39,884 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:39,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:39,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:39,885 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-26 21:25:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:40,070 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-26 21:25:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:40,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:40,076 INFO L225 Difference]: With dead ends: 1257 [2018-09-26 21:25:40,076 INFO L226 Difference]: Without dead ends: 839 [2018-09-26 21:25:40,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-26 21:25:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-26 21:25:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-26 21:25:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-26 21:25:40,204 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-26 21:25:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:40,204 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-26 21:25:40,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-26 21:25:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:40,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:40,215 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:40,215 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:40,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-26 21:25:40,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:40,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:40,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:40,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:40,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:40,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:40,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:40,376 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-26 21:25:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:40,708 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-26 21:25:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:40,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:25:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:40,717 INFO L225 Difference]: With dead ends: 2505 [2018-09-26 21:25:40,718 INFO L226 Difference]: Without dead ends: 1671 [2018-09-26 21:25:40,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-26 21:25:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-26 21:25:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-26 21:25:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-26 21:25:40,943 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-26 21:25:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:40,943 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-26 21:25:40,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-26 21:25:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:25:40,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:40,947 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:40,947 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:40,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-26 21:25:40,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:40,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:40,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:41,122 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:41,123 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:41,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:41,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:41,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:41,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:25:41,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:41,660 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-26 21:25:41,886 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-26 21:25:42,226 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:43,132 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-26 21:25:43,552 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-26 21:25:45,331 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-26 21:25:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:45,750 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-26 21:25:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:25:45,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-26 21:25:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:45,765 INFO L225 Difference]: With dead ends: 4801 [2018-09-26 21:25:45,766 INFO L226 Difference]: Without dead ends: 3135 [2018-09-26 21:25:45,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:25:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-26 21:25:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-26 21:25:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-26 21:25:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-26 21:25:46,172 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-26 21:25:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:46,172 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-26 21:25:46,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:25:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-26 21:25:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:25:46,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:46,177 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:25:46,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:46,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-26 21:25:46,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:46,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:46,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:46,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:46,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:25:46,304 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:46,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:46,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:46,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:46,306 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-26 21:25:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:46,901 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-26 21:25:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:46,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:25:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:46,912 INFO L225 Difference]: With dead ends: 4873 [2018-09-26 21:25:46,912 INFO L226 Difference]: Without dead ends: 2215 [2018-09-26 21:25:46,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-26 21:25:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-26 21:25:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-26 21:25:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-26 21:25:47,239 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-26 21:25:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:47,239 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-26 21:25:47,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-26 21:25:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:25:47,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:47,242 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 21:25:47,242 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:47,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-26 21:25:47,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:47,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:47,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:47,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:47,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-26 21:25:47,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:47,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:47,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:47,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:47,325 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-26 21:25:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:47,364 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-26 21:25:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:47,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:25:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:47,364 INFO L225 Difference]: With dead ends: 1799 [2018-09-26 21:25:47,365 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:25:47,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:25:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:25:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:25:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:25:47,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-26 21:25:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:47,368 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:25:47,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:25:47,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:25:47,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:25:47,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,511 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-26 21:25:47,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,766 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:25:47,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:47,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,364 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:25:48,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:48,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:49,724 WARN L178 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:25:50,368 WARN L178 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:50,563 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:50,880 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:51,249 WARN L178 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:25:51,363 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:51,497 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:25:51,688 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:51,846 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:51,997 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:52,150 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:25:52,388 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:52,391 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-26 21:25:52,392 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-26 21:25:52,392 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-26 21:25:52,392 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-26 21:25:52,392 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:25:52,392 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:25:52,392 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-26 21:25:52,392 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-26 21:25:52,393 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-26 21:25:52,393 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-26 21:25:52,393 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-26 21:25:52,394 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:25:52,394 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-26 21:25:52,394 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-26 21:25:52,395 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-26 21:25:52,395 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-26 21:25:52,395 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-26 21:25:52,395 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-26 21:25:52,395 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-26 21:25:52,395 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-26 21:25:52,396 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-26 21:25:52,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,422 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,431 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,431 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,448 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,448 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,453 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,464 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,482 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 26.09 09:25:52 BoogieIcfgContainer [2018-09-26 21:25:52,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:52,484 INFO L168 Benchmark]: Toolchain (without parser) took 15881.78 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 238.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 423.4 MB). Peak memory consumption was 661.4 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:52,486 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:52,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:52,488 INFO L168 Benchmark]: Boogie Preprocessor took 67.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:52,488 INFO L168 Benchmark]: RCFGBuilder took 731.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:52,489 INFO L168 Benchmark]: TraceAbstraction took 15024.22 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 238.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 381.1 MB). Peak memory consumption was 619.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:52,495 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 731.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15024.22 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 238.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 381.1 MB). Peak memory consumption was 619.1 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-26 21:25:52,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,507 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-26 21:25:52,508 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,509 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,509 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,510 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-26 21:25:52,513 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,513 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,514 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,514 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-26 21:25:52,515 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,515 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,516 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,517 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-26 21:25:52,520 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,521 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,521 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,522 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-26 21:25:52,525 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,526 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-26 21:25:52,531 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,531 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,532 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,532 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-26 21:25:52,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,537 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-26 21:25:52,538 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,541 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,541 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-26 21:25:52,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:52,543 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.8s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-25-52-553.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-25-52-553.csv Received shutdown request...