java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:25:16,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:16,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:16,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:16,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:16,325 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:16,326 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:16,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:16,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:16,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:16,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:16,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:16,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:16,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:16,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:16,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:16,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:16,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:16,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:16,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:16,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:16,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:16,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:16,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:16,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:16,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:16,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:16,357 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:16,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:16,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:16,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:16,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:16,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:16,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:16,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:16,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:16,362 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:25:16,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:16,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:16,378 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:16,378 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:16,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:16,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:16,379 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:16,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:16,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:16,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:16,380 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:16,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:16,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:16,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:16,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:16,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:16,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:16,381 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:16,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:16,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:16,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:16,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:16,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:16,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:16,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:16,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:16,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:16,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:16,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:16,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:16,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:16,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:16,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:16,449 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:16,450 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:16,451 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.1.ufo.UNBOUNDED.pals.c_11.bpl [2018-09-26 21:25:16,451 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl' [2018-09-26 21:25:16,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:16,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:16,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:16,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:16,537 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:16,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:16,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:16,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:16,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:16,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... [2018-09-26 21:25:16,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:16,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:16,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:16,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:16,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:17,279 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:17,279 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:17 BoogieIcfgContainer [2018-09-26 21:25:17,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:17,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:17,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:17,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:17,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:16" (1/2) ... [2018-09-26 21:25:17,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc00ea and model type pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:25:17, skipping insertion in model container [2018-09-26 21:25:17,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:17" (2/2) ... [2018-09-26 21:25:17,287 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl [2018-09-26 21:25:17,297 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:17,304 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:17,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:17,350 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:17,350 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:17,351 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:17,351 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:17,351 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:17,351 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:17,351 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:17,351 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-26 21:25:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:17,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:17,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:17,376 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:17,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-26 21:25:17,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:17,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:17,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:17,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:17,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:17,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:17,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:17,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:17,658 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-26 21:25:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:17,727 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-26 21:25:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:17,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:17,741 INFO L225 Difference]: With dead ends: 51 [2018-09-26 21:25:17,741 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 21:25:17,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 21:25:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-26 21:25:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:25:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-26 21:25:17,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-26 21:25:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:17,786 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-26 21:25:17,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-26 21:25:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:17,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:17,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:17,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:17,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-26 21:25:17,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:17,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:17,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:17,940 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:17,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:17,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:17,945 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-26 21:25:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:17,997 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-26 21:25:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:17,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:17,999 INFO L225 Difference]: With dead ends: 91 [2018-09-26 21:25:18,000 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 21:25:18,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 21:25:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-26 21:25:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:25:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-26 21:25:18,022 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-26 21:25:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:18,022 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-26 21:25:18,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-26 21:25:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:18,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:18,026 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:18,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:18,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-26 21:25:18,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:18,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:18,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:18,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:18,168 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:18,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:18,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:18,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:18,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:18,170 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-26 21:25:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:18,214 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-26 21:25:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:18,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:18,219 INFO L225 Difference]: With dead ends: 175 [2018-09-26 21:25:18,219 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 21:25:18,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 21:25:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-26 21:25:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 21:25:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-26 21:25:18,254 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-26 21:25:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:18,254 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-26 21:25:18,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-26 21:25:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:18,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:18,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:18,258 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:18,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-09-26 21:25:18,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:18,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:18,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:18,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:18,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:18,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:18,494 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 4 states. [2018-09-26 21:25:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:18,776 INFO L93 Difference]: Finished difference Result 245 states and 331 transitions. [2018-09-26 21:25:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:18,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-26 21:25:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:18,780 INFO L225 Difference]: With dead ends: 245 [2018-09-26 21:25:18,781 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 21:25:18,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:25:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 21:25:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 131. [2018-09-26 21:25:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 21:25:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2018-09-26 21:25:18,835 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 16 [2018-09-26 21:25:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:18,837 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2018-09-26 21:25:18,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2018-09-26 21:25:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:18,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:18,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:18,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:18,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-09-26 21:25:18,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:18,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:18,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:18,936 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:18,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:18,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:18,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:18,938 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 3 states. [2018-09-26 21:25:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:19,038 INFO L93 Difference]: Finished difference Result 319 states and 425 transitions. [2018-09-26 21:25:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:19,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:19,046 INFO L225 Difference]: With dead ends: 319 [2018-09-26 21:25:19,046 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 21:25:19,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 21:25:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 21:25:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 21:25:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-09-26 21:25:19,113 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-09-26 21:25:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:19,113 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-09-26 21:25:19,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-09-26 21:25:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:25:19,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:19,117 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:19,118 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:19,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1265916431, now seen corresponding path program 1 times [2018-09-26 21:25:19,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:19,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:19,234 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:19,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:19,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:19,235 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-09-26 21:25:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:19,354 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-09-26 21:25:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:19,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:25:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:19,359 INFO L225 Difference]: With dead ends: 561 [2018-09-26 21:25:19,360 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 21:25:19,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 21:25:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-09-26 21:25:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-26 21:25:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-26 21:25:19,446 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-09-26 21:25:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:19,446 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-26 21:25:19,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-26 21:25:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:25:19,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:19,449 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-09-26 21:25:19,449 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:19,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1524081869, now seen corresponding path program 1 times [2018-09-26 21:25:19,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:19,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:19,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:19,565 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:19,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:19,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:19,569 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-26 21:25:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:19,835 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-26 21:25:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:19,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:25:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:19,840 INFO L225 Difference]: With dead ends: 1113 [2018-09-26 21:25:19,841 INFO L226 Difference]: Without dead ends: 743 [2018-09-26 21:25:19,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-26 21:25:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-26 21:25:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-26 21:25:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-26 21:25:19,968 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-26 21:25:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:19,969 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-26 21:25:19,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-26 21:25:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:25:19,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:19,973 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-09-26 21:25:19,973 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:19,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:19,974 INFO L82 PathProgramCache]: Analyzing trace with hash -714735243, now seen corresponding path program 1 times [2018-09-26 21:25:19,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:19,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:19,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:20,173 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:20,174 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:20,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:20,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:20,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:20,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:25:20,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:20,444 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-26 21:25:20,680 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-26 21:25:20,983 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:21,471 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:21,835 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-26 21:25:23,408 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-26 21:25:23,726 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-26 21:25:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:23,753 INFO L93 Difference]: Finished difference Result 1609 states and 2019 transitions. [2018-09-26 21:25:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:25:23,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-26 21:25:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:23,757 INFO L225 Difference]: With dead ends: 1609 [2018-09-26 21:25:23,757 INFO L226 Difference]: Without dead ends: 565 [2018-09-26 21:25:23,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:25:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-09-26 21:25:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 515. [2018-09-26 21:25:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-09-26 21:25:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-09-26 21:25:23,881 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 30 [2018-09-26 21:25:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:23,881 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-09-26 21:25:23,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:25:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-09-26 21:25:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 21:25:23,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:23,887 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-09-26 21:25:23,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:23,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1918843925, now seen corresponding path program 2 times [2018-09-26 21:25:23,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-26 21:25:23,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:23,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:23,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:23,995 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 3 states. [2018-09-26 21:25:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:24,016 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-09-26 21:25:24,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:24,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-26 21:25:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:24,017 INFO L225 Difference]: With dead ends: 515 [2018-09-26 21:25:24,017 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:25:24,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:25:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:25:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:25:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:25:24,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-26 21:25:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:24,019 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:25:24,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:25:24,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:25:24,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:25:24,509 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-26 21:25:25,537 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-26 21:25:25,656 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:25:25,971 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:25:26,114 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:25:26,413 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:26,690 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-09-26 21:25:26,860 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-26 21:25:27,050 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:25:27,170 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:25:27,383 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-26 21:25:27,958 WARN L178 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-09-26 21:25:28,043 INFO L422 ceAbstractionStarter]: At program point L415(lines 409 416) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-09-26 21:25:28,043 INFO L422 ceAbstractionStarter]: At program point L461(lines 308 461) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-09-26 21:25:28,043 INFO L422 ceAbstractionStarter]: At program point L395(lines 389 396) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-09-26 21:25:28,043 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 464) no Hoare annotation was computed. [2018-09-26 21:25:28,044 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 464) no Hoare annotation was computed. [2018-09-26 21:25:28,044 INFO L422 ceAbstractionStarter]: At program point L375(lines 369 376) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-09-26 21:25:28,044 INFO L422 ceAbstractionStarter]: At program point L400(lines 400 410) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-09-26 21:25:28,044 INFO L422 ceAbstractionStarter]: At program point L458(lines 458 462) the Hoare annotation is: false [2018-09-26 21:25:28,044 INFO L422 ceAbstractionStarter]: At program point L355(lines 349 356) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-09-26 21:25:28,045 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 464) no Hoare annotation was computed. [2018-09-26 21:25:28,045 INFO L422 ceAbstractionStarter]: At program point L380(lines 380 390) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-09-26 21:25:28,045 INFO L422 ceAbstractionStarter]: At program point L442(lines 438 443) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-09-26 21:25:28,045 INFO L422 ceAbstractionStarter]: At program point L335(lines 326 336) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-09-26 21:25:28,045 INFO L422 ceAbstractionStarter]: At program point L360(lines 360 370) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-09-26 21:25:28,046 INFO L422 ceAbstractionStarter]: At program point L315(lines 315 327) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-09-26 21:25:28,046 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 463) no Hoare annotation was computed. [2018-09-26 21:25:28,046 INFO L422 ceAbstractionStarter]: At program point L340(lines 340 350) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-09-26 21:25:28,046 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 439) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse5))) [2018-09-26 21:25:28,046 INFO L422 ceAbstractionStarter]: At program point L452(lines 452 459) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~130) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-26 21:25:28,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,101 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:25:28 BoogieIcfgContainer [2018-09-26 21:25:28,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:28,102 INFO L168 Benchmark]: Toolchain (without parser) took 11568.37 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 212.6 MB). Peak memory consumption was 490.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:28,103 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:28,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:28,104 INFO L168 Benchmark]: Boogie Preprocessor took 45.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:28,105 INFO L168 Benchmark]: RCFGBuilder took 637.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:28,106 INFO L168 Benchmark]: TraceAbstraction took 10820.25 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Peak memory consumption was 458.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:28,110 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 637.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10820.25 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Peak memory consumption was 458.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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: 452]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~130) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 349]: Loop Invariant [2018-09-26 21:25:28,122 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,122 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 369]: Loop Invariant [2018-09-26 21:25:28,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 389]: Loop Invariant [2018-09-26 21:25:28,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 409]: Loop Invariant [2018-09-26 21:25:28,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 340]: Loop Invariant [2018-09-26 21:25:28,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 360]: Loop Invariant [2018-09-26 21:25:28,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 380]: Loop Invariant [2018-09-26 21:25:28,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 400]: Loop Invariant [2018-09-26 21:25:28,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= check_~tmp~130) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 326]: Loop Invariant [2018-09-26 21:25:28,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 431]: Loop Invariant [2018-09-26 21:25:28,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:28,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 10.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 238 SDslu, 219 SDs, 0 SdLazy, 187 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, 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.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 325 NumberOfFragments, 1329 HoareAnnotationTreeSize, 15 FomulaSimplifications, 17278 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 15 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 248 ConstructedInterpolants, 10 QuantifiedInterpolants, 24454 SizeOfPredicates, 1 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 126/140 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.1.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-25-28-150.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-25-28-150.csv Received shutdown request...