java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:46:11,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:46:11,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:46:11,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:46:11,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:46:11,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:46:11,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:46:11,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:46:11,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:46:11,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:46:11,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:46:11,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:46:11,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:46:11,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:46:11,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:46:11,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:46:11,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:46:11,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:46:11,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:46:11,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:46:11,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:46:11,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:46:11,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:46:11,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:46:11,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:46:11,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:46:11,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:46:11,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:46:11,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:46:11,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:46:11,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:46:11,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:46:11,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:46:11,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:46:11,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:46:11,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:46:11,911 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:46:11,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:46:11,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:46:11,924 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:46:11,924 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:46:11,924 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:46:11,924 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:46:11,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:46:11,926 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:46:11,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:46:11,926 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:46:11,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:46:11,926 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:46:11,927 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:46:11,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:46:11,928 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:46:11,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:46:11,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:46:11,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:46:11,996 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:46:11,996 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:46:11,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl [2018-10-10 15:46:11,997 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl' [2018-10-10 15:46:12,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:46:12,062 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:46:12,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:46:12,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:46:12,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:46:12,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... [2018-10-10 15:46:12,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:46:12,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:46:12,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:46:12,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:46:12,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:46:12,202 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:46:12,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:46:12,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:46:12,745 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:46:12,746 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:46:12 BoogieIcfgContainer [2018-10-10 15:46:12,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:46:12,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:46:12,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:46:12,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:46:12,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:46:12" (1/2) ... [2018-10-10 15:46:12,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a0fb9b and model type standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:46:12, skipping insertion in model container [2018-10-10 15:46:12,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:46:12" (2/2) ... [2018-10-10 15:46:12,757 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i_7.bpl [2018-10-10 15:46:12,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:46:12,779 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:46:12,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:46:12,838 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:46:12,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:46:12,839 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:46:12,839 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:46:12,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:46:12,839 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:46:12,839 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:46:12,839 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:46:12,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:46:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-10 15:46:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 15:46:12,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:12,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:12,878 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:12,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1825826060, now seen corresponding path program 1 times [2018-10-10 15:46:12,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:46:13,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 15:46:13,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:46:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:46:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:46:13,784 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-10 15:46:14,447 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 15:46:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:15,072 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 15:46:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:46:15,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-10 15:46:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:15,087 INFO L225 Difference]: With dead ends: 85 [2018-10-10 15:46:15,087 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 15:46:15,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:46:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 15:46:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-10 15:46:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-10 15:46:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-10 15:46:15,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-10 15:46:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:15,133 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-10 15:46:15,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:46:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-10 15:46:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 15:46:15,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:15,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:15,136 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:15,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash -560265094, now seen corresponding path program 1 times [2018-10-10 15:46:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:15,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:15,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:46:15,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:46:15,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:46:15,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:46:15,781 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-10 15:46:16,502 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 15:46:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:17,302 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:46:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:46:17,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-10 15:46:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:17,306 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:46:17,306 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:46:17,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:46:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:46:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-10 15:46:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-10 15:46:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-10 15:46:17,319 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-10 15:46:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:17,320 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-10 15:46:17,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:46:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-10 15:46:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 15:46:17,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:17,324 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:17,324 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:17,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 477354728, now seen corresponding path program 2 times [2018-10-10 15:46:17,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:17,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:17,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:46:17,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:46:17,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:46:17,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:46:17,801 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-10 15:46:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:19,128 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 15:46:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:46:19,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-10 15:46:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:19,133 INFO L225 Difference]: With dead ends: 141 [2018-10-10 15:46:19,133 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 15:46:19,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:46:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 15:46:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-10 15:46:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 15:46:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-10 15:46:19,146 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-10 15:46:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:19,146 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-10 15:46:19,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:46:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-10 15:46:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 15:46:19,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:19,150 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:19,150 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:19,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -267264938, now seen corresponding path program 3 times [2018-10-10 15:46:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:19,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:46:19,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:46:19,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:46:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:46:19,815 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-10 15:46:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:21,619 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 15:46:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:46:21,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-10 15:46:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:21,623 INFO L225 Difference]: With dead ends: 169 [2018-10-10 15:46:21,624 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 15:46:21,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:46:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 15:46:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-10 15:46:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 15:46:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-10 15:46:21,636 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-10 15:46:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:21,636 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-10 15:46:21,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:46:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-10 15:46:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 15:46:21,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:21,639 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:21,640 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:21,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1525189828, now seen corresponding path program 4 times [2018-10-10 15:46:21,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:22,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:22,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:46:22,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:46:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:46:22,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:46:22,289 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-10 15:46:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:24,047 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:46:24,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:46:24,054 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-10 15:46:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:24,056 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:46:24,056 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:46:24,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:46:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:46:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-10 15:46:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:46:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:46:24,070 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-10 15:46:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:24,070 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:46:24,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:46:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:46:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:46:24,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:24,077 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:24,077 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:24,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1982557234, now seen corresponding path program 5 times [2018-10-10 15:46:24,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:25,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:25,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:46:25,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:46:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:46:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:46:25,081 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-10 15:46:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:26,926 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-10 15:46:26,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:46:26,928 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-10 15:46:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:26,930 INFO L225 Difference]: With dead ends: 225 [2018-10-10 15:46:26,930 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 15:46:26,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:46:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 15:46:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-10 15:46:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 15:46:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-10 15:46:26,942 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-10 15:46:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:26,943 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-10 15:46:26,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:46:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-10 15:46:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 15:46:26,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:26,946 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:26,947 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:26,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1389230752, now seen corresponding path program 6 times [2018-10-10 15:46:26,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:27,728 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:46:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:28,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:28,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:46:28,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:46:28,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:46:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:46:28,285 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-10 15:46:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:30,783 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 15:46:30,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:46:30,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-10 15:46:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:30,785 INFO L225 Difference]: With dead ends: 253 [2018-10-10 15:46:30,786 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 15:46:30,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:46:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 15:46:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-10 15:46:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 15:46:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-10 15:46:30,798 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-10 15:46:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:30,798 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-10 15:46:30,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:46:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-10 15:46:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 15:46:30,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:30,802 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:30,802 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:30,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash -645679090, now seen corresponding path program 7 times [2018-10-10 15:46:30,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:31,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:31,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:46:31,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:46:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:46:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:46:31,807 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-10 15:46:34,319 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 15:46:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:34,781 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 15:46:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:46:34,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-10 15:46:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:34,783 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:46:34,783 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:46:34,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:46:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:46:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-10 15:46:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:46:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:46:34,794 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-10 15:46:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:34,794 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:46:34,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:46:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:46:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:46:34,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:34,800 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:34,800 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:34,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1430248324, now seen corresponding path program 8 times [2018-10-10 15:46:34,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:35,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:35,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:46:35,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:46:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:46:35,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:46:35,767 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-10 15:46:36,931 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-10 15:46:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:38,658 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-10 15:46:38,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:46:38,658 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-10 15:46:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:38,660 INFO L225 Difference]: With dead ends: 309 [2018-10-10 15:46:38,660 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 15:46:38,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:46:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 15:46:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-10 15:46:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 15:46:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-10 15:46:38,668 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-10 15:46:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:38,668 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-10 15:46:38,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:46:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-10 15:46:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 15:46:38,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:38,673 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:38,673 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:38,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:38,674 INFO L82 PathProgramCache]: Analyzing trace with hash -21577750, now seen corresponding path program 9 times [2018-10-10 15:46:38,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:39,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:39,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:46:39,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:46:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:46:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:46:39,633 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-10 15:46:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:42,685 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-10 15:46:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:46:42,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-10 15:46:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:42,688 INFO L225 Difference]: With dead ends: 337 [2018-10-10 15:46:42,688 INFO L226 Difference]: Without dead ends: 337 [2018-10-10 15:46:42,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:46:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-10 15:46:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-10 15:46:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 15:46:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-10 15:46:42,695 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-10 15:46:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:42,696 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-10 15:46:42,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:46:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-10 15:46:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 15:46:42,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:42,698 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:42,699 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:42,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2057631144, now seen corresponding path program 10 times [2018-10-10 15:46:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 1290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:43,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:46:43,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:46:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:46:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:46:43,838 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-10 15:46:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:47,363 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-10 15:46:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:46:47,364 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-10 15:46:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:47,366 INFO L225 Difference]: With dead ends: 365 [2018-10-10 15:46:47,366 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 15:46:47,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:46:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 15:46:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-10 15:46:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 15:46:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 15:46:47,374 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-10 15:46:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:47,374 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 15:46:47,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:46:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 15:46:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 15:46:47,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:47,377 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:47,377 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:47,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1180730310, now seen corresponding path program 11 times [2018-10-10 15:46:47,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 0 proven. 1573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:48,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:48,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:46:48,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:46:48,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:46:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:46:48,669 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-10 15:46:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:52,683 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-10 15:46:52,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:46:52,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-10 15:46:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:52,685 INFO L225 Difference]: With dead ends: 393 [2018-10-10 15:46:52,685 INFO L226 Difference]: Without dead ends: 393 [2018-10-10 15:46:52,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:46:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-10 15:46:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-10 15:46:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-10 15:46:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-10 15:46:52,694 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-10 15:46:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:52,694 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-10 15:46:52,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:46:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-10 15:46:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-10 15:46:52,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:52,697 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:52,697 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:52,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2126861260, now seen corresponding path program 12 times [2018-10-10 15:46:52,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:46:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 0 proven. 1884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:46:54,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:46:54,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:46:54,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:46:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:46:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:46:54,349 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-10 15:46:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:46:59,482 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-10 15:46:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:46:59,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-10 15:46:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:46:59,486 INFO L225 Difference]: With dead ends: 421 [2018-10-10 15:46:59,486 INFO L226 Difference]: Without dead ends: 421 [2018-10-10 15:46:59,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:46:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-10 15:46:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-10 15:46:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-10 15:46:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-10 15:46:59,494 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-10 15:46:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:46:59,495 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-10 15:46:59,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:46:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-10 15:46:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-10 15:46:59,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:46:59,498 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:46:59,498 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:46:59,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:46:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1927478366, now seen corresponding path program 13 times [2018-10-10 15:46:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:46:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:01,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:01,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:47:01,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:47:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:47:01,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:47:01,636 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-10 15:47:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:06,610 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-10 15:47:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:47:06,610 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-10 15:47:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:06,613 INFO L225 Difference]: With dead ends: 449 [2018-10-10 15:47:06,613 INFO L226 Difference]: Without dead ends: 449 [2018-10-10 15:47:06,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:47:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-10 15:47:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-10 15:47:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-10 15:47:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-10 15:47:06,622 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-10 15:47:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:06,623 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-10 15:47:06,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:47:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-10 15:47:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-10 15:47:06,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:06,626 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:06,626 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:06,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1191507440, now seen corresponding path program 14 times [2018-10-10 15:47:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:08,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:08,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:47:08,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:47:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:47:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:47:08,632 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-10 15:47:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:14,152 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-10 15:47:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:47:14,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-10 15:47:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:14,155 INFO L225 Difference]: With dead ends: 477 [2018-10-10 15:47:14,155 INFO L226 Difference]: Without dead ends: 477 [2018-10-10 15:47:14,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:47:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-10 15:47:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-10 15:47:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-10 15:47:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-10 15:47:14,164 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-10 15:47:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:14,165 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-10 15:47:14,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:47:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-10 15:47:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-10 15:47:14,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:14,168 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:14,168 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:14,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:14,168 INFO L82 PathProgramCache]: Analyzing trace with hash 730349438, now seen corresponding path program 15 times [2018-10-10 15:47:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2985 backedges. 0 proven. 2985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:16,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:16,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:47:16,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:47:16,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:47:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:47:16,791 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-10 15:47:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:22,795 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-10 15:47:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:47:22,795 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-10 15:47:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:22,798 INFO L225 Difference]: With dead ends: 505 [2018-10-10 15:47:22,799 INFO L226 Difference]: Without dead ends: 505 [2018-10-10 15:47:22,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:47:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-10 15:47:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-10 15:47:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-10 15:47:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-10 15:47:22,808 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-10 15:47:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:22,808 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-10 15:47:22,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:47:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-10 15:47:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-10 15:47:22,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:22,812 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:22,812 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:22,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1019730964, now seen corresponding path program 16 times [2018-10-10 15:47:22,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 0 proven. 3408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:25,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:47:25,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:47:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:47:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:47:25,200 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-10 15:47:25,413 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 15:47:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:31,928 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-10 15:47:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:47:31,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-10 15:47:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:31,931 INFO L225 Difference]: With dead ends: 533 [2018-10-10 15:47:31,931 INFO L226 Difference]: Without dead ends: 533 [2018-10-10 15:47:31,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:47:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-10 15:47:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-10 15:47:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-10 15:47:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-10 15:47:31,942 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-10 15:47:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:31,942 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-10 15:47:31,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:47:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-10 15:47:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-10 15:47:31,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:31,947 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:31,948 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:31,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -163694758, now seen corresponding path program 17 times [2018-10-10 15:47:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 0 proven. 3859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:34,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:34,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:47:34,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:47:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:47:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:47:34,486 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-10 15:47:38,459 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-10 15:47:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:41,942 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-10 15:47:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:47:41,942 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-10 15:47:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:41,945 INFO L225 Difference]: With dead ends: 561 [2018-10-10 15:47:41,945 INFO L226 Difference]: Without dead ends: 561 [2018-10-10 15:47:41,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:47:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-10 15:47:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-10 15:47:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-10 15:47:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-10 15:47:41,953 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-10 15:47:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:41,954 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-10 15:47:41,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:47:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-10 15:47:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-10 15:47:41,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:41,958 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:41,958 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:41,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:41,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1299318328, now seen corresponding path program 18 times [2018-10-10 15:47:41,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4338 backedges. 0 proven. 4338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:44,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:44,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:47:44,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:47:44,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:47:44,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:47:44,186 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-10 15:47:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:47:52,187 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-10 15:47:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:47:52,188 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-10 15:47:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:47:52,190 INFO L225 Difference]: With dead ends: 589 [2018-10-10 15:47:52,190 INFO L226 Difference]: Without dead ends: 589 [2018-10-10 15:47:52,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:47:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-10 15:47:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-10 15:47:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-10 15:47:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-10 15:47:52,200 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-10 15:47:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:47:52,201 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-10 15:47:52,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:47:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-10 15:47:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-10 15:47:52,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:52,205 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:52,206 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:52,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1037757238, now seen corresponding path program 19 times [2018-10-10 15:47:52,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:47:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:47:54,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:47:54,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:47:54,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:47:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:47:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:47:54,455 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-10 15:48:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:03,060 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-10 15:48:03,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:48:03,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-10 15:48:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:03,063 INFO L225 Difference]: With dead ends: 617 [2018-10-10 15:48:03,063 INFO L226 Difference]: Without dead ends: 617 [2018-10-10 15:48:03,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:48:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-10 15:48:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-10 15:48:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-10 15:48:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-10 15:48:03,072 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-10 15:48:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:03,072 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-10 15:48:03,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:48:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-10 15:48:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-10 15:48:03,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:03,077 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:03,077 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:03,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 362318756, now seen corresponding path program 20 times [2018-10-10 15:48:03,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 5380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:48:05,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:05,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:48:05,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:48:05,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:48:05,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:48:05,349 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-10 15:48:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:14,634 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-10 15:48:14,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:48:14,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-10 15:48:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:14,637 INFO L225 Difference]: With dead ends: 645 [2018-10-10 15:48:14,637 INFO L226 Difference]: Without dead ends: 645 [2018-10-10 15:48:14,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:48:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-10 15:48:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-10 15:48:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-10 15:48:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-10 15:48:14,646 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-10 15:48:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:14,646 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-10 15:48:14,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:48:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-10 15:48:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-10 15:48:14,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:14,651 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:14,651 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:14,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash -822453486, now seen corresponding path program 21 times [2018-10-10 15:48:14,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 0 proven. 5943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:48:17,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:17,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:48:17,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:48:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:48:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:48:17,001 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-10 15:48:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:26,877 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-10 15:48:26,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:48:26,879 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-10 15:48:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:26,882 INFO L225 Difference]: With dead ends: 673 [2018-10-10 15:48:26,882 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 15:48:26,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:48:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 15:48:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-10 15:48:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-10 15:48:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-10 15:48:26,890 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-10 15:48:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:26,891 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-10 15:48:26,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:48:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-10 15:48:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-10 15:48:26,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:26,896 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:26,896 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:26,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash -151791232, now seen corresponding path program 22 times [2018-10-10 15:48:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:48:29,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:48:29,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:48:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:48:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:48:29,510 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-10 15:48:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:40,229 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-10 15:48:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:48:40,229 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-10 15:48:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:40,232 INFO L225 Difference]: With dead ends: 701 [2018-10-10 15:48:40,232 INFO L226 Difference]: Without dead ends: 701 [2018-10-10 15:48:40,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:48:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-10 15:48:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-10 15:48:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-10 15:48:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-10 15:48:40,240 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-10 15:48:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:40,241 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-10 15:48:40,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:48:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-10 15:48:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-10 15:48:40,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:40,247 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:40,247 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:40,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash -231176466, now seen corresponding path program 23 times [2018-10-10 15:48:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7153 backedges. 0 proven. 7153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:48:43,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:43,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:48:43,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:48:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:48:43,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:48:43,036 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-10 15:48:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:54,489 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-10 15:48:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:48:54,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-10 15:48:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:54,492 INFO L225 Difference]: With dead ends: 729 [2018-10-10 15:48:54,493 INFO L226 Difference]: Without dead ends: 729 [2018-10-10 15:48:54,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:48:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-10 15:48:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-10 15:48:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-10 15:48:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-10 15:48:54,501 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-10 15:48:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:54,501 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-10 15:48:54,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:48:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-10 15:48:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-10 15:48:54,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:54,507 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:48:54,507 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:54,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash -583277732, now seen corresponding path program 24 times [2018-10-10 15:48:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7800 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:48:57,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:48:57,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:48:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:48:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:48:57,894 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-10 15:49:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:10,255 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-10 15:49:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:49:10,256 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-10 15:49:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:10,260 INFO L225 Difference]: With dead ends: 757 [2018-10-10 15:49:10,260 INFO L226 Difference]: Without dead ends: 757 [2018-10-10 15:49:10,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:49:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-10 15:49:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-10 15:49:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-10 15:49:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-10 15:49:10,268 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-10 15:49:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:10,268 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-10 15:49:10,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:49:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-10 15:49:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-10 15:49:10,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:10,274 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:49:10,275 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:10,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1815178954, now seen corresponding path program 25 times [2018-10-10 15:49:10,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:49:14,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:14,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:49:14,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:49:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:49:14,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:49:14,520 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-10 15:49:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:28,865 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-10 15:49:28,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:49:28,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-10 15:49:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:28,868 INFO L225 Difference]: With dead ends: 785 [2018-10-10 15:49:28,868 INFO L226 Difference]: Without dead ends: 785 [2018-10-10 15:49:28,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:49:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-10 15:49:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-10 15:49:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-10 15:49:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-10 15:49:28,875 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-10 15:49:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:28,876 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-10 15:49:28,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:49:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-10 15:49:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-10 15:49:28,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:28,882 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:49:28,882 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:28,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -888362696, now seen corresponding path program 26 times [2018-10-10 15:49:28,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9178 backedges. 0 proven. 9178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:49:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:32,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:49:32,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:49:32,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:49:32,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:49:32,873 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-10 15:49:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:47,498 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-10 15:49:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:49:47,498 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-10 15:49:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:47,501 INFO L225 Difference]: With dead ends: 813 [2018-10-10 15:49:47,501 INFO L226 Difference]: Without dead ends: 813 [2018-10-10 15:49:47,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:49:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-10 15:49:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-10 15:49:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-10 15:49:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-10 15:49:47,509 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-10 15:49:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:47,510 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-10 15:49:47,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:49:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-10 15:49:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-10 15:49:47,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:47,517 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:49:47,518 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:47,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2105610918, now seen corresponding path program 27 times [2018-10-10 15:49:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9909 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:49:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:49:51,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:49:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:49:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:49:51,165 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-10 15:50:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:50:06,095 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-10 15:50:06,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:50:06,095 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-10 15:50:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:50:06,098 INFO L225 Difference]: With dead ends: 841 [2018-10-10 15:50:06,098 INFO L226 Difference]: Without dead ends: 841 [2018-10-10 15:50:06,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:50:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-10 15:50:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-10 15:50:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-10 15:50:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-10 15:50:06,107 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-10 15:50:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:50:06,107 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-10 15:50:06,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:50:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-10 15:50:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-10 15:50:06,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:50:06,114 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:50:06,115 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:50:06,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:50:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1057106708, now seen corresponding path program 28 times [2018-10-10 15:50:06,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:50:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:50:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10668 backedges. 0 proven. 10668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:50:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:50:09,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:50:09,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:50:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:50:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:50:09,813 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-10 15:50:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:50:25,507 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-10 15:50:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:50:25,508 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-10 15:50:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:50:25,511 INFO L225 Difference]: With dead ends: 869 [2018-10-10 15:50:25,512 INFO L226 Difference]: Without dead ends: 869 [2018-10-10 15:50:25,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:50:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-10 15:50:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-10 15:50:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-10 15:50:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-10 15:50:25,520 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-10 15:50:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:50:25,521 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-10 15:50:25,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:50:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-10 15:50:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-10 15:50:25,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:50:25,529 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:50:25,529 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:50:25,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:50:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -490507646, now seen corresponding path program 29 times [2018-10-10 15:50:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:50:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:50:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11455 backedges. 0 proven. 11455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:50:29,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:50:29,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:50:29,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:50:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:50:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:50:29,406 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-10 15:50:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:50:45,832 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-10 15:50:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:50:45,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-10 15:50:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:50:45,835 INFO L225 Difference]: With dead ends: 897 [2018-10-10 15:50:45,835 INFO L226 Difference]: Without dead ends: 897 [2018-10-10 15:50:45,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:50:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-10 15:50:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-10 15:50:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-10 15:50:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-10 15:50:45,843 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-10 15:50:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:50:45,843 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-10 15:50:45,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:50:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-10 15:50:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-10 15:50:45,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:50:45,851 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:50:45,851 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:50:45,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:50:45,852 INFO L82 PathProgramCache]: Analyzing trace with hash 867723504, now seen corresponding path program 30 times [2018-10-10 15:50:45,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:50:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:50:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12270 backedges. 0 proven. 12270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:50:49,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:50:49,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:50:49,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:50:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:50:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:50:49,882 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-10 15:51:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:51:07,332 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-10 15:51:07,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:51:07,332 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-10 15:51:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:51:07,335 INFO L225 Difference]: With dead ends: 925 [2018-10-10 15:51:07,335 INFO L226 Difference]: Without dead ends: 925 [2018-10-10 15:51:07,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:51:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-10 15:51:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-10 15:51:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-10 15:51:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-10 15:51:07,342 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-10 15:51:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:51:07,342 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-10 15:51:07,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:51:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-10 15:51:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-10 15:51:07,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:51:07,350 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:51:07,350 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:51:07,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:51:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash -728461730, now seen corresponding path program 31 times [2018-10-10 15:51:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:51:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:51:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:51:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:51:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:51:11,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:51:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:51:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:51:11,603 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-10 15:51:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:51:30,038 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-10 15:51:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:51:30,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-10 15:51:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:51:30,041 INFO L225 Difference]: With dead ends: 953 [2018-10-10 15:51:30,042 INFO L226 Difference]: Without dead ends: 953 [2018-10-10 15:51:30,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:51:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-10 15:51:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-10 15:51:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-10 15:51:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-10 15:51:30,049 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-10 15:51:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:51:30,050 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-10 15:51:30,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:51:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-10 15:51:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-10 15:51:30,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:51:30,056 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:51:30,056 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:51:30,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:51:30,056 INFO L82 PathProgramCache]: Analyzing trace with hash 533422796, now seen corresponding path program 32 times [2018-10-10 15:51:30,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:51:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:51:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 0 proven. 13984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:51:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:51:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:51:34,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:51:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:51:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:51:34,534 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-10 15:51:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:51:53,891 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-10 15:51:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:51:53,891 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-10 15:51:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:51:53,894 INFO L225 Difference]: With dead ends: 981 [2018-10-10 15:51:53,894 INFO L226 Difference]: Without dead ends: 981 [2018-10-10 15:51:53,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:51:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-10 15:51:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-10 15:51:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-10 15:51:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-10 15:51:53,902 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-10 15:51:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:51:53,902 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-10 15:51:53,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:51:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-10 15:51:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-10 15:51:53,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:51:53,911 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:51:53,911 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:51:53,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:51:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 126903866, now seen corresponding path program 33 times [2018-10-10 15:51:53,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:51:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:51:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14883 backedges. 0 proven. 14883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:51:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:51:58,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:51:58,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:51:58,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:51:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:51:58,831 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-10 15:52:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:52:19,318 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-10 15:52:19,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:52:19,318 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-10 15:52:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:52:19,321 INFO L225 Difference]: With dead ends: 1009 [2018-10-10 15:52:19,321 INFO L226 Difference]: Without dead ends: 1009 [2018-10-10 15:52:19,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:52:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-10 15:52:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-10 15:52:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-10 15:52:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-10 15:52:19,328 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-10 15:52:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:52:19,329 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-10 15:52:19,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:52:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-10 15:52:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-10 15:52:19,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:52:19,336 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:52:19,337 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:52:19,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:52:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash -170452824, now seen corresponding path program 34 times [2018-10-10 15:52:19,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:52:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:52:21,184 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:52:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15810 backedges. 0 proven. 15810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:52:24,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:52:24,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:52:24,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:52:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:52:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:52:24,842 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-10 15:52:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:52:46,368 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-10 15:52:46,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:52:46,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-10 15:52:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:52:46,372 INFO L225 Difference]: With dead ends: 1037 [2018-10-10 15:52:46,372 INFO L226 Difference]: Without dead ends: 1037 [2018-10-10 15:52:46,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:52:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-10 15:52:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-10 15:52:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-10 15:52:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-10 15:52:46,380 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-10 15:52:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:52:46,380 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-10 15:52:46,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:52:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-10 15:52:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-10 15:52:46,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:52:46,387 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:52:46,387 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:52:46,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:52:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1403848170, now seen corresponding path program 35 times [2018-10-10 15:52:46,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:52:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:52:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16765 backedges. 0 proven. 16765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:52:51,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:52:51,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:52:51,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:52:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:52:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:52:51,975 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-10 15:53:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:53:14,644 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-10 15:53:14,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:53:14,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-10 15:53:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:53:14,653 INFO L225 Difference]: With dead ends: 1065 [2018-10-10 15:53:14,653 INFO L226 Difference]: Without dead ends: 1065 [2018-10-10 15:53:14,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:53:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-10 15:53:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-10 15:53:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-10 15:53:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-10 15:53:14,661 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-10 15:53:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:53:14,662 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-10 15:53:14,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:53:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-10 15:53:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-10 15:53:14,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:53:14,670 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:53:14,671 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:53:14,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:53:14,671 INFO L82 PathProgramCache]: Analyzing trace with hash 611814020, now seen corresponding path program 36 times [2018-10-10 15:53:14,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:53:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:53:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17748 backedges. 0 proven. 17748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:53:20,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:53:20,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:53:20,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:53:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:53:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:53:20,090 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-10 15:53:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:53:43,855 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-10 15:53:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:53:43,855 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-10 15:53:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:53:43,860 INFO L225 Difference]: With dead ends: 1093 [2018-10-10 15:53:43,860 INFO L226 Difference]: Without dead ends: 1093 [2018-10-10 15:53:43,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 15:53:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-10 15:53:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-10 15:53:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-10 15:53:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-10 15:53:43,870 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-10 15:53:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:53:43,871 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-10 15:53:43,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:53:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-10 15:53:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-10 15:53:43,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:53:43,881 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:53:43,881 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:53:43,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:53:43,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1870154226, now seen corresponding path program 37 times [2018-10-10 15:53:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:53:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:53:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18759 backedges. 0 proven. 18759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:53:49,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:53:49,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:53:49,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:53:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:53:49,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:53:49,718 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states. [2018-10-10 15:54:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:54:14,621 INFO L93 Difference]: Finished difference Result 1121 states and 1121 transitions. [2018-10-10 15:54:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:54:14,621 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1066 [2018-10-10 15:54:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:54:14,625 INFO L225 Difference]: With dead ends: 1121 [2018-10-10 15:54:14,625 INFO L226 Difference]: Without dead ends: 1121 [2018-10-10 15:54:14,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1124, Invalid=9382, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:54:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-10 15:54:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1095. [2018-10-10 15:54:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-10 15:54:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1095 transitions. [2018-10-10 15:54:14,632 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1095 transitions. Word has length 1066 [2018-10-10 15:54:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:54:14,633 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1095 transitions. [2018-10-10 15:54:14,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:54:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1095 transitions. [2018-10-10 15:54:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-10 15:54:14,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:54:14,642 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:54:14,642 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:54:14,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:54:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1773619104, now seen corresponding path program 38 times [2018-10-10 15:54:14,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:54:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:54:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19798 backedges. 0 proven. 19798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:54:20,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:54:20,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:54:20,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:54:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:54:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:54:20,517 INFO L87 Difference]: Start difference. First operand 1095 states and 1095 transitions. Second operand 52 states. [2018-10-10 15:54:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:54:46,619 INFO L93 Difference]: Finished difference Result 1149 states and 1149 transitions. [2018-10-10 15:54:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:54:46,620 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1094 [2018-10-10 15:54:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:54:46,623 INFO L225 Difference]: With dead ends: 1149 [2018-10-10 15:54:46,623 INFO L226 Difference]: Without dead ends: 1149 [2018-10-10 15:54:46,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1148, Invalid=9772, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 15:54:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2018-10-10 15:54:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1123. [2018-10-10 15:54:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-10-10 15:54:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1123 transitions. [2018-10-10 15:54:46,632 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1123 transitions. Word has length 1094 [2018-10-10 15:54:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:54:46,632 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1123 transitions. [2018-10-10 15:54:46,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:54:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1123 transitions. [2018-10-10 15:54:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2018-10-10 15:54:46,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:54:46,641 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:54:46,641 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:54:46,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:54:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2040288718, now seen corresponding path program 39 times [2018-10-10 15:54:46,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:54:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:54:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20865 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:54:53,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:54:53,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:54:53,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:54:53,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:54:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2604, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:54:53,108 INFO L87 Difference]: Start difference. First operand 1123 states and 1123 transitions. Second operand 53 states.