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-c372c2b [2018-10-02 12:15:05,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:15:05,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:15:05,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:15:05,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:15:05,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:15:05,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:15:05,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:15:05,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:15:05,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:15:05,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:15:05,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:15:05,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:15:05,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:15:05,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:15:05,381 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:15:05,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:15:05,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:15:05,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:15:05,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:15:05,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:15:05,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:15:05,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:15:05,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:15:05,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:15:05,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:15:05,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:15:05,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:15:05,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:15:05,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:15:05,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:15:05,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:15:05,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:15:05,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:15:05,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:15:05,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:15:05,412 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-02 12:15:05,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:15:05,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:15:05,436 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:15:05,437 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:15:05,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:15:05,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:15:05,438 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:15:05,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:15:05,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:15:05,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:15:05,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:15:05,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:15:05,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:15:05,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:15:05,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:15:05,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:15:05,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:15:05,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:15:05,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:15:05,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:15:05,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:15:05,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:15:05,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:15:05,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:15:05,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:15:05,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:15:05,447 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:15:05,449 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:15:05,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:15:05,450 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:15:05,450 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:15:05,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:15:05,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:15:05,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:15:05,551 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:15:05,552 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:15:05,553 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-02 12:15:05,553 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-02 12:15:05,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:15:05,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:15:05,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:05,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:15:05,644 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:15:05,664 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,684 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:05,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:15:05,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:15:05,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:15:05,707 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,707 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,721 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,721 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,738 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,744 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,753 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 02.10 12:15:05" (1/1) ... [2018-10-02 12:15:05,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:15:05,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:15:05,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:15:05,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:15:05,766 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 02.10 12:15:05" (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-02 12:15:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:15:05,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:15:06,525 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:15:06,525 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 02.10 12:15:06 BoogieIcfgContainer [2018-10-02 12:15:06,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:15:06,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:15:06,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:15:06,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:15:06,530 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 02.10 12:15:05" (1/2) ... [2018-10-02 12:15:06,531 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 02.10 12:15:06, skipping insertion in model container [2018-10-02 12:15:06,531 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 02.10 12:15:06" (2/2) ... [2018-10-02 12:15:06,533 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-02 12:15:06,543 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:15:06,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:15:06,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:15:06,604 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:15:06,604 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:15:06,604 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:15:06,605 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:15:06,605 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:15:06,605 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:15:06,605 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:15:06,605 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:15:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-02 12:15:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:15:06,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:06,629 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:06,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:06,635 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-02 12:15:06,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:06,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:06,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:15:06,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:06,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:06,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:06,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:06,931 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-02 12:15:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:07,070 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-02 12:15:07,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:07,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:15:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:07,086 INFO L225 Difference]: With dead ends: 51 [2018-10-02 12:15:07,086 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 12:15:07,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 12:15:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-02 12:15:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 12:15:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-02 12:15:07,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-02 12:15:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:07,134 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-02 12:15:07,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-02 12:15:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:15:07,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:07,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:07,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:07,136 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-02 12:15:07,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:07,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:07,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:07,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:07,260 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-02 12:15:07,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:07,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:07,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:07,263 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-02 12:15:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:07,334 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-02 12:15:07,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:07,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:15:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:07,336 INFO L225 Difference]: With dead ends: 91 [2018-10-02 12:15:07,336 INFO L226 Difference]: Without dead ends: 61 [2018-10-02 12:15:07,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-02 12:15:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-02 12:15:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 12:15:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-02 12:15:07,358 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-02 12:15:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:07,359 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-02 12:15:07,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-02 12:15:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:15:07,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:07,360 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:07,360 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:07,361 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-02 12:15:07,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:07,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:07,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:07,473 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-02 12:15:07,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:07,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:07,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:07,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:07,474 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-02 12:15:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:07,574 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-02 12:15:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:07,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:15:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:07,579 INFO L225 Difference]: With dead ends: 175 [2018-10-02 12:15:07,579 INFO L226 Difference]: Without dead ends: 117 [2018-10-02 12:15:07,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-02 12:15:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-02 12:15:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-02 12:15:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-02 12:15:07,625 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-02 12:15:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:07,626 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-02 12:15:07,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-02 12:15:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:15:07,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:07,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:07,627 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:07,627 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:07,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-02 12:15:07,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:07,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:07,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:07,736 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-02 12:15:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:07,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:07,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:07,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:07,739 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-02 12:15:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:07,805 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-02 12:15:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:07,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:15:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:07,809 INFO L225 Difference]: With dead ends: 343 [2018-10-02 12:15:07,809 INFO L226 Difference]: Without dead ends: 229 [2018-10-02 12:15:07,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-02 12:15:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-02 12:15:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-02 12:15:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-02 12:15:07,853 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-02 12:15:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:07,853 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-02 12:15:07,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-02 12:15:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:15:07,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:07,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:07,855 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:07,855 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:07,855 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-02 12:15:07,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:07,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:07,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:07,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:07,920 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-02 12:15:07,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:07,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:07,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:07,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:07,922 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:07,922 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-02 12:15:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:08,134 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-02 12:15:08,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:08,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:15:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:08,138 INFO L225 Difference]: With dead ends: 569 [2018-10-02 12:15:08,138 INFO L226 Difference]: Without dead ends: 343 [2018-10-02 12:15:08,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-02 12:15:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-02 12:15:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-02 12:15:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-02 12:15:08,219 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-02 12:15:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:08,219 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-02 12:15:08,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-02 12:15:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:15:08,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:08,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:15:08,221 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:08,221 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:08,221 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-02 12:15:08,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:08,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:08,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:08,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:08,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:08,434 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-02 12:15:08,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:08,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:15:08,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:15:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:15:08,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:08,436 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-02 12:15:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:09,118 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-02 12:15:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:15:09,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-02 12:15:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:09,124 INFO L225 Difference]: With dead ends: 610 [2018-10-02 12:15:09,125 INFO L226 Difference]: Without dead ends: 608 [2018-10-02 12:15:09,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:15:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-02 12:15:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-02 12:15:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-02 12:15:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-02 12:15:09,211 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-02 12:15:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:09,212 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-02 12:15:09,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:15:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-02 12:15:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:15:09,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:09,215 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-02 12:15:09,216 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:09,216 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-02 12:15:09,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:09,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:09,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:09,371 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-02 12:15:09,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:09,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:09,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:09,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:09,373 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-02 12:15:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:09,676 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-02 12:15:09,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:09,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 12:15:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:09,682 INFO L225 Difference]: With dead ends: 1113 [2018-10-02 12:15:09,683 INFO L226 Difference]: Without dead ends: 743 [2018-10-02 12:15:09,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-02 12:15:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-02 12:15:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-02 12:15:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-02 12:15:09,815 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-02 12:15:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:09,816 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-02 12:15:09,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-02 12:15:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:15:09,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:09,822 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-02 12:15:09,822 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:09,822 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-02 12:15:09,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:09,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:09,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:10,183 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-02 12:15:10,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:15:10,183 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-02 12:15:10,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:10,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:15:11,190 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-02 12:15:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:15:11,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-02 12:15:11,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:15:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:15:11,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:11,222 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-02 12:15:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:16,776 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-02 12:15:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:15:16,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-02 12:15:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:16,783 INFO L225 Difference]: With dead ends: 2109 [2018-10-02 12:15:16,784 INFO L226 Difference]: Without dead ends: 1371 [2018-10-02 12:15:16,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.7s impTime [2018-10-02 12:15:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-02 12:15:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-02 12:15:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-02 12:15:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-02 12:15:16,986 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-02 12:15:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:16,987 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-02 12:15:16,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:15:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-02 12:15:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-02 12:15:16,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:16,993 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-02 12:15:16,993 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:16,993 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:16,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-02 12:15:16,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:16,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:16,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:17,131 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-02 12:15:17,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:17,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:17,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:17,133 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-02 12:15:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:17,509 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-02 12:15:17,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:17,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-02 12:15:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:17,517 INFO L225 Difference]: With dead ends: 2161 [2018-10-02 12:15:17,517 INFO L226 Difference]: Without dead ends: 975 [2018-10-02 12:15:17,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-02 12:15:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-02 12:15:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-02 12:15:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-02 12:15:17,686 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-02 12:15:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:17,687 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-02 12:15:17,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-02 12:15:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-02 12:15:17,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:17,689 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-02 12:15:17,689 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:17,689 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-02 12:15:17,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:17,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:17,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:15:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:17,769 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-02 12:15:17,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:17,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:17,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:17,770 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-02 12:15:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:17,789 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-02 12:15:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:17,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-02 12:15:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:17,790 INFO L225 Difference]: With dead ends: 799 [2018-10-02 12:15:17,790 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:15:17,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:15:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:15:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:15:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:15:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:15:17,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-02 12:15:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:17,793 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:15:17,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:15:17,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:15:17,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:15:17,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:17,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:18,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:20,166 WARN L178 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-02 12:15:20,332 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:20,595 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-02 12:15:21,534 WARN L178 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-02 12:15:22,096 WARN L178 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-02 12:15:22,331 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-02 12:15:22,478 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-02 12:15:22,930 WARN L178 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-02 12:15:23,097 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-02 12:15:23,611 WARN L178 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-02 12:15:23,890 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-02 12:15:24,092 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-02 12:15:24,095 INFO L421 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-02 12:15:24,095 INFO L421 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-02 12:15:24,096 INFO L421 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-02 12:15:24,096 INFO L421 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-02 12:15:24,096 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-02 12:15:24,096 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-02 12:15:24,096 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-02 12:15:24,096 INFO L421 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-02 12:15:24,102 INFO L421 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-02 12:15:24,102 INFO L421 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-02 12:15:24,102 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-02 12:15:24,102 INFO L421 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-02 12:15:24,102 INFO L421 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-02 12:15:24,102 INFO L421 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-02 12:15:24,102 INFO L421 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-02 12:15:24,103 INFO L421 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-02 12:15:24,103 INFO L421 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-02 12:15:24,103 INFO L421 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-02 12:15:24,103 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-02 12:15:24,112 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,115 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,125 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,126 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,130 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,132 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,144 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,144 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,149 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,149 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,151 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,152 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,157 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,158 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,160 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,160 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,163 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,169 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,170 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,170 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,173 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,173 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,174 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,174 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,175 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,175 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,180 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,182 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,189 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 02.10 12:15:24 BoogieIcfgContainer [2018-10-02 12:15:24,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:15:24,190 INFO L168 Benchmark]: Toolchain (without parser) took 18552.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 127.4 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -42.0 MB). Peak memory consumption was 598.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:24,192 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:15:24,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.34 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-02 12:15:24,196 INFO L168 Benchmark]: Boogie Preprocessor took 67.84 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-02 12:15:24,197 INFO L168 Benchmark]: RCFGBuilder took 762.74 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-02 12:15:24,198 INFO L168 Benchmark]: TraceAbstraction took 17662.89 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 127.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -84.3 MB). Peak memory consumption was 556.0 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:24,207 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.34 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 67.84 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 762.74 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 17662.89 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 127.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -84.3 MB). Peak memory consumption was 556.0 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-02 12:15:24,221 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,221 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,222 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,222 WARN L390 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-02 12:15:24,223 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,224 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,224 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,224 WARN L390 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-02 12:15:24,225 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,225 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,226 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,226 WARN L390 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-02 12:15:24,230 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,231 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,233 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,233 WARN L390 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-02 12:15:24,235 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,235 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,236 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,236 WARN L390 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-02 12:15:24,237 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,237 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,238 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,238 WARN L390 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-02 12:15:24,239 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,239 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,239 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,240 WARN L390 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-02 12:15:24,243 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,243 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,244 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-02 12:15:24,244 WARN L390 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, 17.5s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s 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, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s 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-02_12-15-24-250.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-02_12-15-24-250.csv Received shutdown request...