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/20170304-DifficultPathPrograms/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:32:42,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:32:42,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:32:42,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:32:42,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:32:42,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:32:42,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:32:42,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:32:42,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:32:42,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:32:42,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:32:42,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:32:42,597 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:32:42,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:32:42,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:32:42,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:32:42,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:32:42,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:32:42,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:32:42,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:32:42,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:32:42,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:32:42,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:32:42,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:32:42,623 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:32:42,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:32:42,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:32:42,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:32:42,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:32:42,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:32:42,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:32:42,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:32:42,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:32:42,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:32:42,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:32:42,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:32:42,636 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 15:32:42,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:32:42,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:32:42,652 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:32:42,652 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:32:42,652 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:32:42,655 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:32:42,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:32:42,656 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:32:42,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:32:42,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:32:42,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:32:42,657 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:32:42,657 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:32:42,658 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:32:42,658 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:32:42,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:32:42,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:32:42,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:32:42,737 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:32:42,738 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:32:42,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2018-10-15 15:32:42,739 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-10-15 15:32:42,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:32:42,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:32:42,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:32:42,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:32:42,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:32:42,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/1) ... [2018-10-15 15:32:42,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:32:42,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:32:42,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:32:42,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:32:42,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (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 15:32:42,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:32:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:32:43,494 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:32:43,495 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:43 BoogieIcfgContainer [2018-10-15 15:32:43,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:32:43,496 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:32:43,496 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:32:43,497 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:32:43,500 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:43" (1/1) ... [2018-10-15 15:32:43,505 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:32:43,521 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:32:43 BasicIcfg [2018-10-15 15:32:43,521 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:32:43,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:32:43,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:32:43,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:32:43,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:32:42" (1/3) ... [2018-10-15 15:32:43,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd100f9 and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:32:43, skipping insertion in model container [2018-10-15 15:32:43,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:32:43" (2/3) ... [2018-10-15 15:32:43,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd100f9 and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:32:43, skipping insertion in model container [2018-10-15 15:32:43,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:32:43" (3/3) ... [2018-10-15 15:32:43,530 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 15:32:43,540 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:32:43,549 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:32:43,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:32:43,591 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:32:43,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:32:43,593 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:32:43,593 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:32:43,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:32:43,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:32:43,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:32:43,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:32:43,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:32:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-15 15:32:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 15:32:43,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:43,621 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] [2018-10-15 15:32:43,623 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:43,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:43,630 INFO L82 PathProgramCache]: Analyzing trace with hash -919780751, now seen corresponding path program 1 times [2018-10-15 15:32:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:43,809 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 15:32:43,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:43,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:32:43,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:32:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:32:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:43,834 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 4 states. [2018-10-15 15:32:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:43,971 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-10-15 15:32:43,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:32:43,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-15 15:32:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:43,986 INFO L225 Difference]: With dead ends: 48 [2018-10-15 15:32:43,987 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 15:32:43,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:32:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 15:32:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-10-15 15:32:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 15:32:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-10-15 15:32:44,029 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 22 [2018-10-15 15:32:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:44,029 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-10-15 15:32:44,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:32:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-10-15 15:32:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 15:32:44,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:44,031 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 15:32:44,031 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:44,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 598201212, now seen corresponding path program 1 times [2018-10-15 15:32:44,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:44,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:44,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:32:44,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:32:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:32:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:44,126 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 4 states. [2018-10-15 15:32:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:44,226 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-10-15 15:32:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:32:44,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-10-15 15:32:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:44,228 INFO L225 Difference]: With dead ends: 44 [2018-10-15 15:32:44,229 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 15:32:44,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:32:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 15:32:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-10-15 15:32:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 15:32:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-15 15:32:44,236 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2018-10-15 15:32:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:44,236 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-15 15:32:44,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:32:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-15 15:32:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 15:32:44,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:44,238 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 15:32:44,239 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:44,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:44,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2092992308, now seen corresponding path program 1 times [2018-10-15 15:32:44,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:44,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:44,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:32:44,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:32:44,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:32:44,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:32:44,491 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 6 states. [2018-10-15 15:32:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:44,804 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-10-15 15:32:44,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:32:44,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-10-15 15:32:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:44,807 INFO L225 Difference]: With dead ends: 52 [2018-10-15 15:32:44,807 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 15:32:44,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 15:32:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-10-15 15:32:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 15:32:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-15 15:32:44,819 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2018-10-15 15:32:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:44,820 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-15 15:32:44,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:32:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-15 15:32:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 15:32:44,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:44,822 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-15 15:32:44,823 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:44,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1465515284, now seen corresponding path program 2 times [2018-10-15 15:32:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-15 15:32:44,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:32:44,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:32:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:32:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:32:44,949 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 6 states. [2018-10-15 15:32:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:45,164 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-10-15 15:32:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:32:45,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-15 15:32:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:45,167 INFO L225 Difference]: With dead ends: 92 [2018-10-15 15:32:45,167 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 15:32:45,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 15:32:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2018-10-15 15:32:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 15:32:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-10-15 15:32:45,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 46 [2018-10-15 15:32:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:45,178 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-10-15 15:32:45,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:32:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-10-15 15:32:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 15:32:45,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:45,181 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-10-15 15:32:45,181 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:45,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1561576039, now seen corresponding path program 3 times [2018-10-15 15:32:45,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-15 15:32:45,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:32:45,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:32:45,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:32:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:32:45,345 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 8 states. [2018-10-15 15:32:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:45,917 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-10-15 15:32:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:32:45,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-10-15 15:32:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:45,921 INFO L225 Difference]: With dead ends: 97 [2018-10-15 15:32:45,921 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 15:32:45,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 15:32:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-10-15 15:32:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 15:32:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-10-15 15:32:45,931 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 70 [2018-10-15 15:32:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:45,931 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-10-15 15:32:45,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:32:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-10-15 15:32:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 15:32:45,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:45,933 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 3, 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] [2018-10-15 15:32:45,934 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:45,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2145238743, now seen corresponding path program 4 times [2018-10-15 15:32:45,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-15 15:32:46,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:46,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:32:46,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:32:46,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:32:46,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:32:46,142 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 8 states. [2018-10-15 15:32:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:46,335 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-10-15 15:32:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:32:46,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2018-10-15 15:32:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:46,342 INFO L225 Difference]: With dead ends: 148 [2018-10-15 15:32:46,343 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 15:32:46,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 15:32:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2018-10-15 15:32:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 15:32:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-10-15 15:32:46,368 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 86 [2018-10-15 15:32:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:46,368 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-10-15 15:32:46,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:32:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-10-15 15:32:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 15:32:46,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:46,375 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:46,376 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:46,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 734374666, now seen corresponding path program 5 times [2018-10-15 15:32:46,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 180 proven. 30 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-15 15:32:46,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:46,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:32:46,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:46,773 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 10 states. [2018-10-15 15:32:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:47,109 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-10-15 15:32:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:32:47,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 118 [2018-10-15 15:32:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:47,112 INFO L225 Difference]: With dead ends: 158 [2018-10-15 15:32:47,112 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 15:32:47,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:32:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 15:32:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2018-10-15 15:32:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 15:32:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2018-10-15 15:32:47,123 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 118 [2018-10-15 15:32:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:47,124 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2018-10-15 15:32:47,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2018-10-15 15:32:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 15:32:47,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:47,127 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:47,127 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:47,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1606671666, now seen corresponding path program 6 times [2018-10-15 15:32:47,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-15 15:32:47,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:47,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:32:47,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:47,609 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand 10 states. [2018-10-15 15:32:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:47,909 INFO L93 Difference]: Finished difference Result 220 states and 225 transitions. [2018-10-15 15:32:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:32:47,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2018-10-15 15:32:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:47,912 INFO L225 Difference]: With dead ends: 220 [2018-10-15 15:32:47,912 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 15:32:47,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:32:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 15:32:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 183. [2018-10-15 15:32:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 15:32:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2018-10-15 15:32:47,932 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 142 [2018-10-15 15:32:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:47,932 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2018-10-15 15:32:47,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2018-10-15 15:32:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 15:32:47,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:47,936 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 16, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:47,937 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:47,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash 317478941, now seen corresponding path program 7 times [2018-10-15 15:32:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 449 proven. 56 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-10-15 15:32:48,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:48,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:48,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:48,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:48,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:48,268 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 12 states. [2018-10-15 15:32:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:48,578 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-10-15 15:32:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:32:48,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 182 [2018-10-15 15:32:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:48,590 INFO L225 Difference]: With dead ends: 235 [2018-10-15 15:32:48,590 INFO L226 Difference]: Without dead ends: 235 [2018-10-15 15:32:48,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:32:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-15 15:32:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 215. [2018-10-15 15:32:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 15:32:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2018-10-15 15:32:48,604 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 182 [2018-10-15 15:32:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:48,604 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2018-10-15 15:32:48,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2018-10-15 15:32:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 15:32:48,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:48,609 INFO L375 BasicCegarLoop]: trace histogram [24, 20, 20, 20, 20, 20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:48,609 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:48,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:48,610 INFO L82 PathProgramCache]: Analyzing trace with hash -864606979, now seen corresponding path program 8 times [2018-10-15 15:32:48,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1736 backedges. 677 proven. 90 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2018-10-15 15:32:48,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:32:48,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:32:48,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:32:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:48,919 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 14 states. [2018-10-15 15:32:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:49,290 INFO L93 Difference]: Finished difference Result 267 states and 271 transitions. [2018-10-15 15:32:49,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:32:49,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 214 [2018-10-15 15:32:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:49,293 INFO L225 Difference]: With dead ends: 267 [2018-10-15 15:32:49,294 INFO L226 Difference]: Without dead ends: 267 [2018-10-15 15:32:49,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:32:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-15 15:32:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 247. [2018-10-15 15:32:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 15:32:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 251 transitions. [2018-10-15 15:32:49,301 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 251 transitions. Word has length 214 [2018-10-15 15:32:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:49,302 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 251 transitions. [2018-10-15 15:32:49,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:32:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 251 transitions. [2018-10-15 15:32:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 15:32:49,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:49,305 INFO L375 BasicCegarLoop]: trace histogram [28, 24, 24, 24, 24, 24, 24, 24, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:49,305 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:49,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1570271709, now seen corresponding path program 9 times [2018-10-15 15:32:49,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2456 backedges. 0 proven. 1928 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-10-15 15:32:49,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:49,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:49,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:49,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:49,832 INFO L87 Difference]: Start difference. First operand 247 states and 251 transitions. Second operand 12 states. [2018-10-15 15:32:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:50,307 INFO L93 Difference]: Finished difference Result 356 states and 362 transitions. [2018-10-15 15:32:50,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:32:50,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-10-15 15:32:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:50,310 INFO L225 Difference]: With dead ends: 356 [2018-10-15 15:32:50,310 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 15:32:50,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:32:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 15:32:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 303. [2018-10-15 15:32:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 15:32:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 308 transitions. [2018-10-15 15:32:50,318 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 308 transitions. Word has length 246 [2018-10-15 15:32:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:50,318 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 308 transitions. [2018-10-15 15:32:50,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 308 transitions. [2018-10-15 15:32:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 15:32:50,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:50,322 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:50,322 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:50,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 35765560, now seen corresponding path program 10 times [2018-10-15 15:32:50,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3870 backedges. 0 proven. 3210 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-15 15:32:50,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:50,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:32:50,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:32:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:32:50,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:50,849 INFO L87 Difference]: Start difference. First operand 303 states and 308 transitions. Second operand 14 states. [2018-10-15 15:32:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:51,641 INFO L93 Difference]: Finished difference Result 412 states and 419 transitions. [2018-10-15 15:32:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:32:51,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 302 [2018-10-15 15:32:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:51,644 INFO L225 Difference]: With dead ends: 412 [2018-10-15 15:32:51,645 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 15:32:51,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:32:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 15:32:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 359. [2018-10-15 15:32:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 15:32:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 365 transitions. [2018-10-15 15:32:51,652 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 365 transitions. Word has length 302 [2018-10-15 15:32:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:51,653 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 365 transitions. [2018-10-15 15:32:51,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:32:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 365 transitions. [2018-10-15 15:32:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 15:32:51,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:51,657 INFO L375 BasicCegarLoop]: trace histogram [42, 36, 36, 36, 36, 36, 36, 36, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:51,657 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:51,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash 837630867, now seen corresponding path program 11 times [2018-10-15 15:32:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5604 backedges. 1587 proven. 132 refuted. 0 times theorem prover too weak. 3885 trivial. 0 not checked. [2018-10-15 15:32:51,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:51,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:32:51,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:32:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:32:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:32:51,978 INFO L87 Difference]: Start difference. First operand 359 states and 365 transitions. Second operand 16 states. [2018-10-15 15:32:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:52,632 INFO L93 Difference]: Finished difference Result 437 states and 443 transitions. [2018-10-15 15:32:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:32:52,632 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 358 [2018-10-15 15:32:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:52,637 INFO L225 Difference]: With dead ends: 437 [2018-10-15 15:32:52,637 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 15:32:52,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:32:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 15:32:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 407. [2018-10-15 15:32:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-15 15:32:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 413 transitions. [2018-10-15 15:32:52,645 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 413 transitions. Word has length 358 [2018-10-15 15:32:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:52,646 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 413 transitions. [2018-10-15 15:32:52,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:32:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 413 transitions. [2018-10-15 15:32:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-15 15:32:52,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:52,648 INFO L375 BasicCegarLoop]: trace histogram [48, 42, 42, 42, 42, 42, 42, 42, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:52,648 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:52,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash 907357411, now seen corresponding path program 12 times [2018-10-15 15:32:52,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7524 backedges. 0 proven. 6432 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-10-15 15:32:53,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:53,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:32:53,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:32:53,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:32:53,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:32:53,773 INFO L87 Difference]: Start difference. First operand 407 states and 413 transitions. Second operand 16 states. [2018-10-15 15:32:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:54,175 INFO L93 Difference]: Finished difference Result 532 states and 540 transitions. [2018-10-15 15:32:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:32:54,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 406 [2018-10-15 15:32:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:54,178 INFO L225 Difference]: With dead ends: 532 [2018-10-15 15:32:54,178 INFO L226 Difference]: Without dead ends: 532 [2018-10-15 15:32:54,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:32:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-10-15 15:32:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 471. [2018-10-15 15:32:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-15 15:32:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 478 transitions. [2018-10-15 15:32:54,187 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 478 transitions. Word has length 406 [2018-10-15 15:32:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:54,188 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 478 transitions. [2018-10-15 15:32:54,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:32:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 478 transitions. [2018-10-15 15:32:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-10-15 15:32:54,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:54,191 INFO L375 BasicCegarLoop]: trace histogram [56, 49, 49, 49, 49, 49, 49, 49, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:54,191 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:54,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1524334602, now seen corresponding path program 13 times [2018-10-15 15:32:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10276 backedges. 2552 proven. 182 refuted. 0 times theorem prover too weak. 7542 trivial. 0 not checked. [2018-10-15 15:32:54,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:54,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:32:54,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:32:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:32:54,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:32:54,590 INFO L87 Difference]: Start difference. First operand 471 states and 478 transitions. Second operand 18 states. [2018-10-15 15:32:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:55,361 INFO L93 Difference]: Finished difference Result 562 states and 569 transitions. [2018-10-15 15:32:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:32:55,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 470 [2018-10-15 15:32:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:55,370 INFO L225 Difference]: With dead ends: 562 [2018-10-15 15:32:55,370 INFO L226 Difference]: Without dead ends: 562 [2018-10-15 15:32:55,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:32:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-10-15 15:32:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 527. [2018-10-15 15:32:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-15 15:32:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 534 transitions. [2018-10-15 15:32:55,380 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 534 transitions. Word has length 470 [2018-10-15 15:32:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:55,380 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 534 transitions. [2018-10-15 15:32:55,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:32:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 534 transitions. [2018-10-15 15:32:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-10-15 15:32:55,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:55,384 INFO L375 BasicCegarLoop]: trace histogram [63, 56, 56, 56, 56, 56, 56, 56, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:55,384 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:55,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash -567911682, now seen corresponding path program 14 times [2018-10-15 15:32:55,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 11606 refuted. 0 times theorem prover too weak. 1680 trivial. 0 not checked. [2018-10-15 15:32:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:56,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:32:56,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:32:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:32:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:32:56,363 INFO L87 Difference]: Start difference. First operand 527 states and 534 transitions. Second operand 18 states. [2018-10-15 15:32:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:58,603 INFO L93 Difference]: Finished difference Result 668 states and 677 transitions. [2018-10-15 15:32:58,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:32:58,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 526 [2018-10-15 15:32:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:58,607 INFO L225 Difference]: With dead ends: 668 [2018-10-15 15:32:58,607 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 15:32:58,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:32:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 15:32:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 599. [2018-10-15 15:32:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-10-15 15:32:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 607 transitions. [2018-10-15 15:32:58,619 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 607 transitions. Word has length 526 [2018-10-15 15:32:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:58,620 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 607 transitions. [2018-10-15 15:32:58,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:32:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 607 transitions. [2018-10-15 15:32:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-10-15 15:32:58,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:58,626 INFO L375 BasicCegarLoop]: trace histogram [72, 64, 64, 64, 64, 64, 64, 64, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:58,627 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:58,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2042452791, now seen corresponding path program 15 times [2018-10-15 15:32:58,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17392 backedges. 3845 proven. 240 refuted. 0 times theorem prover too weak. 13307 trivial. 0 not checked. [2018-10-15 15:33:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:00,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 15:33:00,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 15:33:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 15:33:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:33:00,100 INFO L87 Difference]: Start difference. First operand 599 states and 607 transitions. Second operand 20 states. [2018-10-15 15:33:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:01,107 INFO L93 Difference]: Finished difference Result 703 states and 711 transitions. [2018-10-15 15:33:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:33:01,108 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 598 [2018-10-15 15:33:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:01,111 INFO L225 Difference]: With dead ends: 703 [2018-10-15 15:33:01,112 INFO L226 Difference]: Without dead ends: 703 [2018-10-15 15:33:01,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:33:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-10-15 15:33:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 663. [2018-10-15 15:33:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-15 15:33:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 671 transitions. [2018-10-15 15:33:01,122 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 671 transitions. Word has length 598 [2018-10-15 15:33:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:01,122 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 671 transitions. [2018-10-15 15:33:01,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 15:33:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 671 transitions. [2018-10-15 15:33:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-10-15 15:33:01,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:01,128 INFO L375 BasicCegarLoop]: trace histogram [80, 72, 72, 72, 72, 72, 72, 72, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:01,128 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:01,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2008445303, now seen corresponding path program 16 times [2018-10-15 15:33:01,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 4825 proven. 306 refuted. 0 times theorem prover too weak. 16709 trivial. 0 not checked. [2018-10-15 15:33:02,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:02,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:33:02,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:33:02,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:33:02,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:33:02,634 INFO L87 Difference]: Start difference. First operand 663 states and 671 transitions. Second operand 22 states. [2018-10-15 15:33:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:03,399 INFO L93 Difference]: Finished difference Result 727 states and 735 transitions. [2018-10-15 15:33:03,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:33:03,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 662 [2018-10-15 15:33:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:03,409 INFO L225 Difference]: With dead ends: 727 [2018-10-15 15:33:03,409 INFO L226 Difference]: Without dead ends: 727 [2018-10-15 15:33:03,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=747, Invalid=1703, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:33:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-15 15:33:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-10-15 15:33:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-10-15 15:33:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 735 transitions. [2018-10-15 15:33:03,420 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 735 transitions. Word has length 662 [2018-10-15 15:33:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:03,421 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 735 transitions. [2018-10-15 15:33:03,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:33:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 735 transitions. [2018-10-15 15:33:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-15 15:33:03,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:03,427 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 80, 80, 80, 80, 80, 80, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:03,427 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:03,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash 996571209, now seen corresponding path program 17 times [2018-10-15 15:33:03,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 26800 backedges. 0 proven. 23760 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-10-15 15:33:05,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:05,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 15:33:05,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 15:33:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 15:33:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:33:05,027 INFO L87 Difference]: Start difference. First operand 727 states and 735 transitions. Second operand 20 states. [2018-10-15 15:33:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:06,089 INFO L93 Difference]: Finished difference Result 900 states and 910 transitions. [2018-10-15 15:33:06,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:33:06,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 726 [2018-10-15 15:33:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:06,093 INFO L225 Difference]: With dead ends: 900 [2018-10-15 15:33:06,093 INFO L226 Difference]: Without dead ends: 900 [2018-10-15 15:33:06,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:33:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-10-15 15:33:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 815. [2018-10-15 15:33:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-15 15:33:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 824 transitions. [2018-10-15 15:33:06,105 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 824 transitions. Word has length 726 [2018-10-15 15:33:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:06,106 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 824 transitions. [2018-10-15 15:33:06,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 15:33:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 824 transitions. [2018-10-15 15:33:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-15 15:33:06,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:06,113 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 90, 90, 90, 90, 90, 90, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:06,113 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:06,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1282305668, now seen corresponding path program 18 times [2018-10-15 15:33:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 0 proven. 30546 refuted. 0 times theorem prover too weak. 3420 trivial. 0 not checked. [2018-10-15 15:33:07,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:07,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:33:07,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:33:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:33:07,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:33:07,765 INFO L87 Difference]: Start difference. First operand 815 states and 824 transitions. Second operand 22 states. [2018-10-15 15:33:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:08,773 INFO L93 Difference]: Finished difference Result 903 states and 913 transitions. [2018-10-15 15:33:08,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:33:08,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 814 [2018-10-15 15:33:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:08,779 INFO L225 Difference]: With dead ends: 903 [2018-10-15 15:33:08,780 INFO L226 Difference]: Without dead ends: 903 [2018-10-15 15:33:08,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=747, Invalid=1703, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:33:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-10-15 15:33:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2018-10-15 15:33:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-10-15 15:33:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 913 transitions. [2018-10-15 15:33:08,792 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 913 transitions. Word has length 814 [2018-10-15 15:33:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:08,793 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 913 transitions. [2018-10-15 15:33:08,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:33:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 913 transitions. [2018-10-15 15:33:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2018-10-15 15:33:08,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:08,801 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 100, 100, 100, 100, 100, 100, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:08,802 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:08,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -326186049, now seen corresponding path program 19 times [2018-10-15 15:33:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41980 backedges. 41962 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-15 15:33:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [205] imperfect sequences [] total 205 [2018-10-15 15:33:22,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-10-15 15:33:22,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-10-15 15:33:22,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10407, Invalid=31413, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 15:33:22,878 INFO L87 Difference]: Start difference. First operand 903 states and 913 transitions. Second operand 205 states. [2018-10-15 15:33:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,829 INFO L93 Difference]: Finished difference Result 37442 states and 37902 transitions. [2018-10-15 15:33:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2018-10-15 15:33:39,829 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 902 [2018-10-15 15:33:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,830 INFO L225 Difference]: With dead ends: 37442 [2018-10-15 15:33:39,830 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:33:39,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30399 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=51217, Invalid=114025, Unknown=0, NotChecked=0, Total=165242 [2018-10-15 15:33:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:33:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:33:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:33:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:33:39,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 902 [2018-10-15 15:33:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,843 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:33:39,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-10-15 15:33:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:33:39,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:33:39,849 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:39 BasicIcfg [2018-10-15 15:33:39,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:33:39,850 INFO L168 Benchmark]: Toolchain (without parser) took 57058.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 446.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-15 15:33:39,852 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-15 15:33:39,853 INFO L168 Benchmark]: Boogie Preprocessor took 44.76 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 15:33:39,853 INFO L168 Benchmark]: RCFGBuilder took 657.08 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 15:33:39,854 INFO L168 Benchmark]: IcfgTransformer took 25.75 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 15:33:39,854 INFO L168 Benchmark]: TraceAbstraction took 56326.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 425.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-15 15:33:39,858 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.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. * Boogie Preprocessor took 44.76 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 657.08 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 25.75 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 56326.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 425.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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, 35 locations, 1 error locations. SAFE Result, 56.2s OverallTime, 21 OverallIterations, 110 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1900 SDtfs, 3677 SDslu, 9508 SDs, 0 SdLazy, 2560 SolverSat, 328 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 957 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 915 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33819 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=903occurred in iteration=20, 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 599 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 6958 NumberOfCodeBlocks, 6958 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6937 ConstructedInterpolants, 0 QuantifiedInterpolants, 13085651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 110036/189128 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/nested.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-33-39-870.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-33-39-870.csv Received shutdown request...