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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:32:54,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:32:54,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:32:54,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:32:54,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:32:54,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:32:54,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:32:54,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:32:54,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:32:54,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:32:54,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:32:54,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:32:54,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:32:54,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:32:54,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:32:54,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:32:54,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:32:54,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:32:54,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:32:54,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:32:54,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:32:54,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:32:54,455 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:32:54,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:32:54,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:32:54,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:32:54,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:32:54,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:32:54,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:32:54,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:32:54,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:32:54,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:32:54,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:32:54,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:32:54,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:32:54,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:32:54,466 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:32:54,487 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:32:54,487 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:32:54,488 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:32:54,489 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:32:54,489 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:32:54,489 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:32:54,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:32:54,490 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:32:54,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:32:54,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:32:54,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:32:54,491 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:32:54,491 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:32:54,492 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:32:54,492 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:32:54,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:32:54,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:32:54,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:32:54,576 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:32:54,577 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:32:54,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl [2018-10-10 15:32:54,578 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl' [2018-10-10 15:32:54,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:32:54,656 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:32:54,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:32:54,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:32:54,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:32:54,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/1) ... [2018-10-10 15:32:54,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:32:54,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:32:54,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:32:54,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:32:54,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:32:54,799 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:32:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:32:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:32:55,498 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:32:55,499 INFO L202 PluginConnector]: Adding new model diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:32:55 BoogieIcfgContainer [2018-10-10 15:32:55,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:32:55,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:32:55,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:32:55,504 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:32:55,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:32:54" (1/2) ... [2018-10-10 15:32:55,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e58dcd and model type diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:32:55, skipping insertion in model container [2018-10-10 15:32:55,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:32:55" (2/2) ... [2018-10-10 15:32:55,507 INFO L112 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i_15.bpl [2018-10-10 15:32:55,518 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:32:55,526 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:32:55,544 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:32:55,574 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:32:55,574 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:32:55,575 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:32:55,575 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:32:55,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:32:55,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:32:55,575 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:32:55,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:32:55,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:32:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-10-10 15:32:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 15:32:55,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:55,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:55,612 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:55,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1855468826, now seen corresponding path program 1 times [2018-10-10 15:32:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:56,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:32:56,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:32:56,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:32:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:32:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:32:56,296 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 8 states. [2018-10-10 15:32:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:56,655 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2018-10-10 15:32:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:32:56,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-10-10 15:32:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:56,672 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:32:56,672 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:32:56,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:32:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:32:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2018-10-10 15:32:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 15:32:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-10-10 15:32:56,726 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 76 [2018-10-10 15:32:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:56,727 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-10-10 15:32:56,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:32:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-10-10 15:32:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 15:32:56,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:56,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:56,732 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:56,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1644367544, now seen corresponding path program 1 times [2018-10-10 15:32:56,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:32:56,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:32:56,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:32:56,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:32:56,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:32:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:32:56,894 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 4 states. [2018-10-10 15:32:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:56,969 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-10-10 15:32:56,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:32:56,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-10-10 15:32:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:56,978 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:32:56,978 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:32:56,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:32:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:32:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-10-10 15:32:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 15:32:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-10-10 15:32:56,997 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 97 [2018-10-10 15:32:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:56,998 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-10-10 15:32:56,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:32:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-10-10 15:32:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 15:32:57,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:57,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:57,002 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:57,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1647690663, now seen corresponding path program 1 times [2018-10-10 15:32:57,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:32:57,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:32:57,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 15:32:57,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:32:57,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:32:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:32:57,810 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 12 states. [2018-10-10 15:32:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:59,169 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2018-10-10 15:32:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:32:59,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-10-10 15:32:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:59,173 INFO L225 Difference]: With dead ends: 171 [2018-10-10 15:32:59,173 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 15:32:59,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:32:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 15:32:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-10 15:32:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 15:32:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2018-10-10 15:32:59,187 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 170 transitions. Word has length 99 [2018-10-10 15:32:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:59,188 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 170 transitions. [2018-10-10 15:32:59,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:32:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 170 transitions. [2018-10-10 15:32:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 15:32:59,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:59,192 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:59,192 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:59,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2123365913, now seen corresponding path program 1 times [2018-10-10 15:32:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 15:33:00,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:00,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:33:00,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:33:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:33:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:33:00,309 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand 19 states. [2018-10-10 15:33:01,796 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-10-10 15:33:02,409 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-10 15:33:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:03,184 INFO L93 Difference]: Finished difference Result 385 states and 403 transitions. [2018-10-10 15:33:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:33:03,185 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 150 [2018-10-10 15:33:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:03,189 INFO L225 Difference]: With dead ends: 385 [2018-10-10 15:33:03,189 INFO L226 Difference]: Without dead ends: 385 [2018-10-10 15:33:03,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:33:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-10 15:33:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 212. [2018-10-10 15:33:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 15:33:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2018-10-10 15:33:03,203 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 150 [2018-10-10 15:33:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:03,203 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2018-10-10 15:33:03,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:33:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2018-10-10 15:33:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:33:03,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:03,207 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:03,208 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:03,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1062568806, now seen corresponding path program 1 times [2018-10-10 15:33:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 15:33:03,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:03,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:33:03,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:33:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:33:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:33:03,878 INFO L87 Difference]: Start difference. First operand 212 states and 221 transitions. Second operand 21 states. [2018-10-10 15:33:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:06,267 INFO L93 Difference]: Finished difference Result 436 states and 457 transitions. [2018-10-10 15:33:06,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:33:06,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2018-10-10 15:33:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:06,273 INFO L225 Difference]: With dead ends: 436 [2018-10-10 15:33:06,273 INFO L226 Difference]: Without dead ends: 436 [2018-10-10 15:33:06,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=428, Invalid=1378, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:33:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-10 15:33:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 248. [2018-10-10 15:33:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-10 15:33:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 260 transitions. [2018-10-10 15:33:06,287 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 260 transitions. Word has length 179 [2018-10-10 15:33:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:06,288 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 260 transitions. [2018-10-10 15:33:06,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:33:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 260 transitions. [2018-10-10 15:33:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 15:33:06,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:06,292 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:06,293 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:06,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash -411067481, now seen corresponding path program 2 times [2018-10-10 15:33:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 15:33:07,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:07,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:33:07,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:33:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:33:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:33:07,617 INFO L87 Difference]: Start difference. First operand 248 states and 260 transitions. Second operand 23 states. [2018-10-10 15:33:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:10,883 INFO L93 Difference]: Finished difference Result 491 states and 515 transitions. [2018-10-10 15:33:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:33:10,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 201 [2018-10-10 15:33:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:10,890 INFO L225 Difference]: With dead ends: 491 [2018-10-10 15:33:10,890 INFO L226 Difference]: Without dead ends: 361 [2018-10-10 15:33:10,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=658, Invalid=2204, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:33:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-10 15:33:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 298. [2018-10-10 15:33:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 15:33:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-10-10 15:33:10,907 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 201 [2018-10-10 15:33:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:10,908 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-10-10 15:33:10,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:33:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-10-10 15:33:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-10 15:33:10,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:10,914 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:10,914 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:10,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2043264313, now seen corresponding path program 2 times [2018-10-10 15:33:10,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 26 proven. 153 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 15:33:12,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:12,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:33:12,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:33:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:33:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:33:12,045 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 23 states. [2018-10-10 15:33:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:14,799 INFO L93 Difference]: Finished difference Result 467 states and 490 transitions. [2018-10-10 15:33:14,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:33:14,800 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 208 [2018-10-10 15:33:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:14,804 INFO L225 Difference]: With dead ends: 467 [2018-10-10 15:33:14,804 INFO L226 Difference]: Without dead ends: 467 [2018-10-10 15:33:14,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:33:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-10 15:33:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 298. [2018-10-10 15:33:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 15:33:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-10-10 15:33:14,812 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 208 [2018-10-10 15:33:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:14,813 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-10-10 15:33:14,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:33:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-10-10 15:33:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:33:14,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:14,816 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:14,816 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:14,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1979002348, now seen corresponding path program 3 times [2018-10-10 15:33:14,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 5 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 15:33:15,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:15,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:33:15,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:33:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:33:15,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:33:15,821 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 25 states. [2018-10-10 15:33:17,352 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-10-10 15:33:17,844 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-10 15:33:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:19,816 INFO L93 Difference]: Finished difference Result 529 states and 555 transitions. [2018-10-10 15:33:19,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:33:19,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 230 [2018-10-10 15:33:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:19,820 INFO L225 Difference]: With dead ends: 529 [2018-10-10 15:33:19,820 INFO L226 Difference]: Without dead ends: 341 [2018-10-10 15:33:19,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=780, Invalid=2642, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:33:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-10 15:33:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 333. [2018-10-10 15:33:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 15:33:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 349 transitions. [2018-10-10 15:33:19,827 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 349 transitions. Word has length 230 [2018-10-10 15:33:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:19,828 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 349 transitions. [2018-10-10 15:33:19,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:33:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 349 transitions. [2018-10-10 15:33:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:33:19,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:19,830 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:19,830 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:19,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash -586269990, now seen corresponding path program 4 times [2018-10-10 15:33:19,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 32 proven. 186 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 15:33:20,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:20,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:33:20,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:33:20,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:33:20,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:33:20,731 INFO L87 Difference]: Start difference. First operand 333 states and 349 transitions. Second operand 25 states. [2018-10-10 15:33:21,585 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-10 15:33:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:24,553 INFO L93 Difference]: Finished difference Result 506 states and 531 transitions. [2018-10-10 15:33:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:33:24,554 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 230 [2018-10-10 15:33:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:24,557 INFO L225 Difference]: With dead ends: 506 [2018-10-10 15:33:24,557 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 15:33:24,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=774, Invalid=2648, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:33:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 15:33:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2018-10-10 15:33:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 15:33:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 295 transitions. [2018-10-10 15:33:24,564 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 295 transitions. Word has length 230 [2018-10-10 15:33:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:24,564 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 295 transitions. [2018-10-10 15:33:24,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:33:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 295 transitions. [2018-10-10 15:33:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-10 15:33:24,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:33:24,566 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:33:24,566 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:33:24,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:33:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash 219705031, now seen corresponding path program 5 times [2018-10-10 15:33:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:33:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:33:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 299 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 15:33:25,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:33:25,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:33:25,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:33:25,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:33:25,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:33:25,552 INFO L87 Difference]: Start difference. First operand 282 states and 295 transitions. Second operand 27 states. [2018-10-10 15:33:27,928 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-10 15:33:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:30,084 INFO L93 Difference]: Finished difference Result 351 states and 367 transitions. [2018-10-10 15:33:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:33:30,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 259 [2018-10-10 15:33:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:30,086 INFO L225 Difference]: With dead ends: 351 [2018-10-10 15:33:30,086 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:33:30,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=853, Invalid=3179, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:33:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:33:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:33:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:33:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:33:30,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2018-10-10 15:33:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:30,089 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:33:30,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:33:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:33:30,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:33:30,094 INFO L202 PluginConnector]: Adding new model diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:33:30 BoogieIcfgContainer [2018-10-10 15:33:30,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:33:30,095 INFO L168 Benchmark]: Toolchain (without parser) took 35440.67 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 404.8 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -391.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2018-10-10 15:33:30,096 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:33:30,097 INFO L168 Benchmark]: Boogie Preprocessor took 68.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:33:30,097 INFO L168 Benchmark]: RCFGBuilder took 774.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:33:30,098 INFO L168 Benchmark]: TraceAbstraction took 34594.02 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 404.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -423.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:33:30,101 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 774.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34594.02 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 404.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -423.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. SAFE Result, 34.5s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 25.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1920 SDtfs, 15654 SDslu, 14991 SDs, 0 SdLazy, 7279 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 680 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1729 NumberOfCodeBlocks, 1729 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 4715625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 123/1246 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/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-33-30-112.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-33-30-112.csv Received shutdown request...