java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:54:46,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:54:46,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:54:46,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:54:46,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:54:46,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:54:46,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:54:46,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:54:46,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:54:46,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:54:46,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:54:46,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:54:46,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:54:46,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:54:46,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:54:46,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:54:46,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:54:46,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:54:46,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:54:46,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:54:46,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:54:46,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:54:46,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:54:46,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:54:46,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:54:46,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:54:46,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:54:46,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:54:46,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:54:46,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:54:46,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:54:46,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:54:46,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:54:46,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:54:46,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:54:46,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:54:46,547 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:54:46,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:54:46,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:54:46,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:54:46,571 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:54:46,571 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:54:46,572 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:54:46,572 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:54:46,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:54:46,572 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:54:46,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:54:46,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:54:46,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:54:46,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:54:46,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:54:46,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:54:46,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:54:46,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:54:46,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:54:46,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:54:46,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:54:46,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:54:46,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:54:46,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:54:46,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:54:46,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:54:46,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:54:46,579 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:54:46,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:54:46,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:54:46,580 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:54:46,580 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:54:46,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:54:46,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:54:46,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:54:46,643 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:54:46,643 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:54:46,644 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-01 00:54:46,645 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-01 00:54:46,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:54:46,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:54:46,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:54:46,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:54:46,773 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:54:46,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:54:46,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:54:46,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:54:46,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:54:46,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... [2018-10-01 00:54:46,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:54:46,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:54:46,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:54:46,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:54:46,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:54:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:54:46,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:54:47,634 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:54:47,635 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:54:47 BoogieIcfgContainer [2018-10-01 00:54:47,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:54:47,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:54:47,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:54:47,639 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:54:47,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:54:46" (1/2) ... [2018-10-01 00:54:47,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752be85d and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:54:47, skipping insertion in model container [2018-10-01 00:54:47,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:54:47" (2/2) ... [2018-10-01 00:54:47,643 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-01 00:54:47,654 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:54:47,663 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:54:47,713 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:54:47,714 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:54:47,714 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:54:47,715 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:54:47,715 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:54:47,715 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:54:47,715 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:54:47,715 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:54:47,715 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:54:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-01 00:54:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:54:47,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:47,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:47,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:47,748 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-01 00:54:47,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:47,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:47,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:48,026 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:48,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:54:48,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:48,044 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:48,046 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-01 00:54:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:48,182 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-01 00:54:48,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:48,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:54:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:48,202 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:54:48,202 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:54:48,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:54:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-01 00:54:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:54:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-01 00:54:48,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-01 00:54:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:48,261 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-01 00:54:48,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-01 00:54:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:54:48,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:48,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:48,262 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:48,263 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-01 00:54:48,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:48,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:48,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:48,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:54:48,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:48,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:48,403 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-01 00:54:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:48,467 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-01 00:54:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:48,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:54:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:48,470 INFO L225 Difference]: With dead ends: 91 [2018-10-01 00:54:48,470 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 00:54:48,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 00:54:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-01 00:54:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:54:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-01 00:54:48,489 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-01 00:54:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:48,489 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-01 00:54:48,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-01 00:54:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:54:48,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:48,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:48,491 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:48,491 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-01 00:54:48,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:48,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:48,610 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:48,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:54:48,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:48,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:48,611 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-01 00:54:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:48,720 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-01 00:54:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:48,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:54:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:48,725 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:54:48,725 INFO L226 Difference]: Without dead ends: 117 [2018-10-01 00:54:48,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-01 00:54:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-01 00:54:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-01 00:54:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-01 00:54:48,792 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-01 00:54:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:48,793 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-01 00:54:48,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-01 00:54:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:54:48,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:48,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:48,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:48,795 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-01 00:54:48,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:48,925 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:48,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:54:48,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:48,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:48,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:48,928 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-01 00:54:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:49,040 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-01 00:54:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:49,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:54:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:49,043 INFO L225 Difference]: With dead ends: 343 [2018-10-01 00:54:49,043 INFO L226 Difference]: Without dead ends: 229 [2018-10-01 00:54:49,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-01 00:54:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-01 00:54:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-01 00:54:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-01 00:54:49,085 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-01 00:54:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:49,086 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-01 00:54:49,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-01 00:54:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:54:49,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:49,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:49,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:49,088 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:49,088 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-01 00:54:49,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:49,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:49,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:49,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:49,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:49,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:49,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:54:49,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:49,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:49,180 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-01 00:54:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:49,372 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-01 00:54:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:49,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:54:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:49,376 INFO L225 Difference]: With dead ends: 569 [2018-10-01 00:54:49,376 INFO L226 Difference]: Without dead ends: 343 [2018-10-01 00:54:49,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-01 00:54:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-01 00:54:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-01 00:54:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-01 00:54:49,441 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-01 00:54:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:49,441 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-01 00:54:49,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-01 00:54:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:54:49,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:49,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:49,447 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:49,447 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-01 00:54:49,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:49,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:49,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:49,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:49,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:54:49,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:54:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:54:49,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:49,693 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-01 00:54:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:50,315 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-01 00:54:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:54:50,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-01 00:54:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:50,319 INFO L225 Difference]: With dead ends: 610 [2018-10-01 00:54:50,320 INFO L226 Difference]: Without dead ends: 608 [2018-10-01 00:54:50,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:54:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-01 00:54:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-01 00:54:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-01 00:54:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-01 00:54:50,385 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-01 00:54:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:50,386 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-01 00:54:50,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:54:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-01 00:54:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:54:50,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:50,389 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] [2018-10-01 00:54:50,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:50,390 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-01 00:54:50,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:50,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:50,538 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:50,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:54:50,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:50,539 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:50,539 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-01 00:54:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:50,811 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-01 00:54:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:50,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-01 00:54:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:50,820 INFO L225 Difference]: With dead ends: 1113 [2018-10-01 00:54:50,820 INFO L226 Difference]: Without dead ends: 743 [2018-10-01 00:54:50,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-01 00:54:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-01 00:54:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-01 00:54:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-01 00:54:50,936 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-01 00:54:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:50,937 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-01 00:54:50,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-01 00:54:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:54:50,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:50,943 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:54:50,944 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:50,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-01 00:54:50,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:54:51,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:51,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:51,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:51,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:54:52,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:52,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-01 00:54:52,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:54:52,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:54:52,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:52,123 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-01 00:54:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:56,766 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-01 00:54:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:54:56,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-01 00:54:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:56,773 INFO L225 Difference]: With dead ends: 2109 [2018-10-01 00:54:56,773 INFO L226 Difference]: Without dead ends: 1371 [2018-10-01 00:54:56,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:54:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-01 00:54:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-01 00:54:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-01 00:54:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-01 00:54:56,954 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-01 00:54:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:56,954 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-01 00:54:56,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:54:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-01 00:54:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:54:56,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:56,959 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:54:56,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:56,959 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-01 00:54:56,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:56,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-01 00:54:57,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:57,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:54:57,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:57,070 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:57,071 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-01 00:54:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:57,372 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-01 00:54:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:57,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-01 00:54:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:57,381 INFO L225 Difference]: With dead ends: 2161 [2018-10-01 00:54:57,381 INFO L226 Difference]: Without dead ends: 975 [2018-10-01 00:54:57,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-01 00:54:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-01 00:54:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-01 00:54:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-01 00:54:57,544 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-01 00:54:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:57,544 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-01 00:54:57,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-01 00:54:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:54:57,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:57,546 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-01 00:54:57,547 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:57,547 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-01 00:54:57,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:57,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-01 00:54:57,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:57,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:54:57,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:54:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:54:57,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:57,654 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-01 00:54:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:57,671 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-01 00:54:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:54:57,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-01 00:54:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:57,672 INFO L225 Difference]: With dead ends: 799 [2018-10-01 00:54:57,672 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:54:57,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:54:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:54:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:54:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:54:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:54:57,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-01 00:54:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:57,674 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:54:57,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:54:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:54:57,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:54:57,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:54:57,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:57,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:58,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:00,436 WARN L178 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-01 00:55:00,632 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:00,962 WARN L178 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-01 00:55:01,098 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-01 00:55:01,316 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-01 00:55:01,454 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-01 00:55:01,698 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-01 00:55:01,897 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:02,313 WARN L178 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-01 00:55:02,497 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-01 00:55:02,736 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-01 00:55:02,739 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (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 .cse7))) [2018-10-01 00:55:02,740 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-01 00:55:02,740 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:55:02,740 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (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 .cse7))) [2018-10-01 00:55:02,740 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-01 00:55:02,740 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-01 00:55:02,741 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-01 00:55:02,741 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) 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-10-01 00:55:02,741 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-01 00:55:02,741 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-10-01 00:55:02,741 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-01 00:55:02,742 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) 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-10-01 00:55:02,742 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-01 00:55:02,742 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-01 00:55:02,742 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-01 00:55:02,743 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-01 00:55:02,743 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-01 00:55:02,743 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-01 00:55:02,743 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-01 00:55:02,751 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,752 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,764 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,764 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,767 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,767 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,773 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,773 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,775 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,775 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,780 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,780 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,781 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,782 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,783 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,783 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,785 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,787 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,788 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,790 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,790 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,795 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,798 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:02 BoogieIcfgContainer [2018-10-01 00:55:02,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:02,799 INFO L168 Benchmark]: Toolchain (without parser) took 16034.03 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 126.9 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -54.6 MB). Peak memory consumption was 597.8 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:02,803 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:02,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:02,804 INFO L168 Benchmark]: Boogie Preprocessor took 49.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:02,805 INFO L168 Benchmark]: RCFGBuilder took 763.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:02,809 INFO L168 Benchmark]: TraceAbstraction took 15162.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 126.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -96.9 MB). Peak memory consumption was 555.5 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:02,817 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 763.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15162.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 126.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -96.9 MB). Peak memory consumption was 555.5 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-10-01 00:55:02,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,830 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,836 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~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) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-10-01 00:55:02,837 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,838 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,838 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,839 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: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-10-01 00:55:02,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~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)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-10-01 00:55:02,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,853 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,853 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 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) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-10-01 00:55:02,854 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,854 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~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) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-10-01 00:55:02,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,859 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: 358]: Loop Invariant [2018-10-01 00:55:02,859 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,863 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~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)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-10-01 00:55:02,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:02,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 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) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 15.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-02-870.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-02-870.csv Received shutdown request...