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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_true-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:14:57,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:14:57,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:14:57,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:14:57,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:14:57,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:14:57,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:14:57,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:14:57,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:14:57,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:14:57,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:14:57,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:14:57,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:14:57,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:14:57,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:14:57,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:14:57,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:14:57,691 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:14:57,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:14:57,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:14:57,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:14:57,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:14:57,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:14:57,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:14:57,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:14:57,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:14:57,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:14:57,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:14:57,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:14:57,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:14:57,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:14:57,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:14:57,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:14:57,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:14:57,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:14:57,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:14:57,713 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-15 13:14:57,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:14:57,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:14:57,726 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:14:57,726 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:14:57,727 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:14:57,727 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:14:57,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:14:57,728 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:14:57,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:14:57,728 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:14:57,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:14:57,729 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:14:57,729 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:14:57,730 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:14:57,730 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:14:57,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:14:57,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:14:57,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:14:57,796 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:14:57,797 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:14:57,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 13:14:57,798 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 13:14:57,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:14:57,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:14:57,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:14:57,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:14:57,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:14:57,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/1) ... [2018-10-15 13:14:57,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:14:57,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:14:57,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:14:57,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:14:57,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (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-15 13:14:57,987 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:14:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:14:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:14:58,209 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:14:58,210 INFO L202 PluginConnector]: Adding new model underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:58 BoogieIcfgContainer [2018-10-15 13:14:58,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:14:58,212 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:14:58,212 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:14:58,213 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:14:58,216 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:58" (1/1) ... [2018-10-15 13:14:58,221 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:14:58,238 INFO L202 PluginConnector]: Adding new model underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:14:58 BasicIcfg [2018-10-15 13:14:58,238 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:14:58,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:14:58,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:14:58,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:14:58,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:57" (1/3) ... [2018-10-15 13:14:58,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca8d5b7 and model type underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:14:58, skipping insertion in model container [2018-10-15 13:14:58,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:58" (2/3) ... [2018-10-15 13:14:58,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca8d5b7 and model type underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:58, skipping insertion in model container [2018-10-15 13:14:58,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:14:58" (3/3) ... [2018-10-15 13:14:58,246 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:14:58,256 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:14:58,265 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:14:58,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:14:58,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:14:58,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:14:58,312 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:14:58,312 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:14:58,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:14:58,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:14:58,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:14:58,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:14:58,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:14:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-15 13:14:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-15 13:14:58,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:58,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:58,337 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:58,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -634109058, now seen corresponding path program 1 times [2018-10-15 13:14:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:58,572 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-15 13:14:58,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:14:58,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:14:58,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:14:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:14:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:14:58,623 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-15 13:14:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:58,708 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 13:14:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:14:58,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-15 13:14:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:58,723 INFO L225 Difference]: With dead ends: 19 [2018-10-15 13:14:58,723 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 13:14:58,725 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-10-15 13:14:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 13:14:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-10-15 13:14:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 13:14:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 13:14:58,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-15 13:14:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:58,762 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 13:14:58,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:14:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 13:14:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 13:14:58,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:58,763 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:58,764 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:58,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 8299235, now seen corresponding path program 1 times [2018-10-15 13:14:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:58,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:58,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:14:58,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:14:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:14:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:14:58,965 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-10-15 13:14:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:59,112 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:14:59,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:14:59,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-15 13:14:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:59,113 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:14:59,114 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:14:59,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:14:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-15 13:14:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 13:14:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-15 13:14:59,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-15 13:14:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:59,120 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-15 13:14:59,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:14:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-15 13:14:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 13:14:59,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:59,121 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:59,121 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:59,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 19995294, now seen corresponding path program 2 times [2018-10-15 13:14:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:59,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:59,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:14:59,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:14:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:14:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:59,531 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 7 states. [2018-10-15 13:14:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:59,859 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 13:14:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:14:59,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-10-15 13:14:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:59,861 INFO L225 Difference]: With dead ends: 29 [2018-10-15 13:14:59,862 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 13:14:59,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 13:14:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-15 13:14:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 13:14:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 13:14:59,868 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-15 13:14:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:59,869 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 13:14:59,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:14:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 13:14:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 13:14:59,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:59,871 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:59,872 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:59,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash -276086845, now seen corresponding path program 3 times [2018-10-15 13:14:59,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:00,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:00,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:15:00,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:15:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:15:00,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:15:00,077 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2018-10-15 13:15:00,331 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:15:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:00,746 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 13:15:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:15:00,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-10-15 13:15:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:00,747 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:15:00,748 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 13:15:00,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:15:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 13:15:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-10-15 13:15:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-15 13:15:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-15 13:15:00,753 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-15 13:15:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:00,754 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-15 13:15:00,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:15:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-15 13:15:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 13:15:00,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:00,755 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:00,756 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:00,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1273203134, now seen corresponding path program 4 times [2018-10-15 13:15:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:01,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:01,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:15:01,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:15:01,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:15:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:15:01,002 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 11 states. [2018-10-15 13:15:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:01,458 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 13:15:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:15:01,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-10-15 13:15:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:01,461 INFO L225 Difference]: With dead ends: 39 [2018-10-15 13:15:01,461 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 13:15:01,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:15:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 13:15:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-15 13:15:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 13:15:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 13:15:01,468 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-15 13:15:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:01,470 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 13:15:01,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:15:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 13:15:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 13:15:01,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:01,472 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:01,472 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:01,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 614548643, now seen corresponding path program 5 times [2018-10-15 13:15:01,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:02,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:02,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:15:02,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:15:02,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:15:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:15:02,073 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 13 states. [2018-10-15 13:15:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:02,628 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 13:15:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:15:02,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-10-15 13:15:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:02,629 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:15:02,629 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:15:02,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:15:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:15:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-10-15 13:15:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 13:15:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-15 13:15:02,635 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-15 13:15:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:02,636 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-15 13:15:02,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:15:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-15 13:15:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 13:15:02,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:02,638 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:02,638 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:02,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 640520414, now seen corresponding path program 6 times [2018-10-15 13:15:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:15,104 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 178956971 c_ULTIMATE.start_main_~y~0) 89478484))) (<= .cse0 (* 268435456 (div .cse0 268435456)))) is different from false [2018-10-15 13:15:39,352 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 715827883 c_ULTIMATE.start_main_~y~0) 357913936))) (<= .cse0 (* 1073741824 (div .cse0 1073741824)))) is different from false [2018-10-15 13:16:51,288 WARN L179 SmtUtils]: Spent 13.71 s on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:16:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 12 times theorem prover too weak. 0 trivial. 47 not checked. [2018-10-15 13:16:52,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:52,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:16:52,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:16:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:16:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=68, Unknown=7, NotChecked=34, Total=132 [2018-10-15 13:16:52,667 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 12 states. [2018-10-15 13:19:23,585 WARN L179 SmtUtils]: Spent 862.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 13:20:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:26,301 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 13:20:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:20:26,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-15 13:20:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:26,303 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:20:26,303 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 13:20:26,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 147.8s TimeCoverageRelationStatistics Valid=35, Invalid=95, Unknown=10, NotChecked=42, Total=182 [2018-10-15 13:20:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 13:20:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-10-15 13:20:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:20:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 13:20:26,308 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-15 13:20:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:26,309 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 13:20:26,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:20:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 13:20:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:20:26,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:26,311 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:26,311 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:26,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1360966019, now seen corresponding path program 7 times [2018-10-15 13:20:26,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 31 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:20:26,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:20:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:20:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:20:26,656 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 15 states. [2018-10-15 13:20:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:27,134 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-10-15 13:20:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:20:27,134 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-10-15 13:20:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:27,135 INFO L225 Difference]: With dead ends: 35 [2018-10-15 13:20:27,135 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 13:20:27,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:20:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 13:20:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 13:20:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 13:20:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 13:20:27,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-10-15 13:20:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:27,139 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 13:20:27,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:20:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 13:20:27,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 13:20:27,145 INFO L202 PluginConnector]: Adding new model underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:20:27 BasicIcfg [2018-10-15 13:20:27,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:20:27,147 INFO L168 Benchmark]: Toolchain (without parser) took 329291.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 364.8 MB). Peak memory consumption was 364.8 MB. Max. memory is 7.1 GB. [2018-10-15 13:20:27,148 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-15 13:20:27,148 INFO L168 Benchmark]: Boogie Preprocessor took 50.30 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-15 13:20:27,149 INFO L168 Benchmark]: RCFGBuilder took 303.63 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 13:20:27,150 INFO L168 Benchmark]: IcfgTransformer took 26.33 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-10-15 13:20:27,151 INFO L168 Benchmark]: TraceAbstraction took 328906.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 343.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 7.1 GB. [2018-10-15 13:20:27,155 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.30 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 303.63 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 26.33 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. * TraceAbstraction took 328906.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 343.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: 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, 18 locations, 1 error locations. SAFE Result, 328.8s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 216.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 148 SDtfs, 47 SDslu, 803 SDs, 0 SdLazy, 942 SolverSat, 23 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 174.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 150.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 111.9s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 47510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 31/308 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/underapprox_true-unreach-call1_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-20-27-167.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_true-unreach-call1_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-20-27-167.csv Received shutdown request...